Linear time algorithm to find a minimal deadlock in a strongly connected free-choice net
- 1 January 1993
- book chapter
- Published by Springer Nature
- p. 319-338
- https://doi.org/10.1007/3-540-56863-8_54
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- A polynomial-time graph algorithm to decide liveness of some basic classes of bounded Petri netsPublished by Springer Nature ,1992
- An efficient polynomial-time algorithm to decide liveness and boundedness of free-choice netsPublished by Springer Nature ,1992
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972