Affiliations: [a] Parallel Systems, Department of Computing Science, Carl von Ossietzky Universität Oldenburg, D-26111 Oldenburg, Germany. [email protected] | [b] Département d’Informatique, Université Libre de Bruxelles, Boulevard du Triomphe - C.P. 212, B-1050 Bruxelles, Belgium. [email protected]
Note: [*] Address for correspondence: Parallel Systems, Department of Computing Science, Carl von Ossietzky Universität Oldenburg, D-26111 Oldenburg, Germany
Abstract: This paper presents a dedicated Petri net synthesis algorithm for the case that a transition system is finite, live, and persistent. In particular, the paper delineates exactly when and how a structurally persistent net may be constructed, by crystallising, out of a general region-theoretic approach, a minimised set of simplified systems of linear inequalities. This extends previous results where reversibility, instead of liveness, played an important role.
Keywords: Cyclic Behaviour, Persistence, Labelled Transition Systems, Liveness, Parikh Vectors, Petri Nets, Region Theory, System Synthesis
