State space axioms for T-systems
- First Online:
- Cite this article as:
- Best, E. & Devillers, R. Acta Informatica (2015) 52: 133. doi:10.1007/s00236-015-0219-0
- 158 Downloads
T-systems are generalisations of marked graph Petri nets. This paper describes synthesis algorithms that allow bounded or unbounded T-systems to be derived from finite or infinite labelled transition systems satisfying a set of necessary properties. These properties can thus be interpreted as axioms characterising T-system state spaces.