Shortest paths in reachability graphs
- 1 January 1993
- book chapter
- Published by Springer Nature
- p. 224-241
- https://doi.org/10.1007/3-540-56863-8_49
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Model checking of persistent Petri netsPublished by Springer Nature ,2005
- A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri netsInformation Processing Letters, 1991
- Partial order behaviour and structure of Petri netsFormal Aspects of Computing, 1990
- On questions of fairness and temporal logic for conflict-free Petri netsPublished by Springer Nature ,1988
- A fresh look at free choice netsInformation and Control, 1984
- Free choice systems have home statesActa Informatica, 1984
- Properties of Conflict-Free and Persistent Petri NetsJournal of the ACM, 1978
- SynchronisationsgraphenActa Informatica, 1973
- Marked directed graphsJournal of Computer and System Sciences, 1971