Compositional generation of home states in free choice systems
Free choice nets are a class of Petri nets allowing to model concurrency and nondeterministic choice, but with the restriction that choices cannot be influenced externally. Home states are ground states which lead to a strongly connected state graph, that is, a home state can be reached from any of its successor states. The main result of this paper characterises the home states of a structurally live and bounded free choice system compositionally by recourse to its decomposition into T-components.
KeywordsFree Choice Petri Nets Reversibility Home States Cyclic Behaviour Compositionality
Unable to display preview. Download preview PDF.
- E. Best, L. Cherkasova, J. Desel and J. Esparza: Characterisation of Home States in Free Choice Systems. Hildesheimer Informatik-Berichte Nr. 9/90 (September 1990).Google Scholar
- E. Best, J. Desel and J. Esparza: Traps Characterise Home States in Free Choice Systems. Submitted Paper (June 1990).Google Scholar
- F. Commoner, A.W. Holt, S. Even and A. Pnueli: Marked Directed Graphs. Journal of Computer and System Science Vol.5, 511–523 (1971).Google Scholar
- J. Desel and J. Esparza: Reachability in Reversible Free Choice Systems. Proceedings of STACS'91, Lecture Notes in Computer Science, Springer Verlag (1991).Google Scholar
- M. Hack: Analysis of Production Schemata by Petri Nets. TR-94, MIT-MAC (1972). Corrections (1974).Google Scholar
- W. Reisig: Petri Nets — an Introduction. EATCS Monographs on Theoretical Computer Science, Vol. 4, Springer Verlag (1985).Google Scholar