Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets
The structure of the reachability graph of a live and bounded marked graph Petri net is fully characterised. A dedicated synthesis procedure is presented which allows the net and its bounds to be computed from its reachability graph.
KeywordsPetri nets region theory system synthesis transition systems
Unable to display preview. Download preview PDF.
- 1.Badouel, E., Bernardinello, L., Darondeau, P.: Theory of Regions (to appear)Google Scholar
- 6.Best, E., Devillers, R.: Solving LTS with Parikh-unique Cycles. Technical Report (2013)Google Scholar
- 10.Kondratyev, A., Cortadella, J., Kishinevsky, M., Pastor, E., Roig, O., Yakovlev, A.: Checking Signal Transition Graph Implementability by Symbolic BDD Traversal. In: Proc. European Design and Test Conference, Paris, France, pp. 325–332 (1995)Google Scholar