A proof of the Rank Theorem for extended free choice nets
- 1 January 1992
- book chapter
- Published by Springer Nature
- Vol. 616, 134-153
- https://doi.org/10.1007/3-540-55676-1_8
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Reachability in cyclic extended free-choice systemsTheoretical Computer Science, 1993
- A polynomial-time algorithm to decide liveness of bounded free choice netsTheoretical Computer Science, 1992
- Traps characterize home states in free choice systemsTheoretical Computer Science, 1992
- Struktur und Analyse von Free-Choice-PetrinetzenPublished by Springer Nature ,1992
- Properties and performance bounds for closed free choice synchronized monoclass queueing networksIEEE Transactions on Automatic Control, 1991
- Partial order behaviour and structure of Petri netsFormal Aspects of Computing, 1990