State space axioms for T-systems (Q2340253)

The authors define T-systems as Petri nets without forward or backward branching places. In contrast to marked graphs, places without input- or output-transitions are allowed. The paper characterises (finite or infinite) labelled transition systems which are isomorphic to state spaces of T-systems and provides synthesis algorithms for T-systems from labelled transition systems satisfying the characterising properties.