Partial order behaviour and structure of Petri nets
- 1 March 1990
- journal article
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 2 (1) , 123-138
- https://doi.org/10.1007/bf01888220
Abstract
This paper argues that partial order semantics can be used profitably in the proofs of some nontrivial results in Petri net theory. We show that most of Commoner's and Hack's structure theory of free choice nets can be phrased and proved in terms of partial order behaviour. The new proofs are considerably shorter (and, arguably, more lucid) than the old ones; they also generalise the results from (safe) free choice nets to (bounded) extended free choice nets.Keywords
This publication has 8 references indexed in Scilit:
- Petri NetsPublished by Springer Nature ,1988
- Sequential and concurrent behaviour in Petri net theoryTheoretical Computer Science, 1987
- Some Classes of Live and Safe Petri NetsPublished by Springer Nature ,1987
- Modeling concurrency with partial ordersInternational Journal of Parallel Programming, 1986
- A fresh look at free choice netsInformation and Control, 1984
- The non-sequential behaviour of Petri netsInformation and Control, 1983
- Weighted Synchronic DistancesPublished by Springer Nature ,1982
- Linear algebra in net theoryPublished by Springer Nature ,1980