Acta Informatica

, Volume 52, Issue 2–3, pp 133–152

State space axioms for T-systems

Original Article

DOI: 10.1007/s00236-015-0219-0

Cite this article as:
Best, E. & Devillers, R. Acta Informatica (2015) 52: 133. doi:10.1007/s00236-015-0219-0


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.

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  1. 1.Department of Computing ScienceCarl von Ossietzky Universität OldenburgOldenburgGermany
  2. 2.Département d’InformatiqueUniversité Libre de BruxellesBrusselsBelgium

Personalised recommendations