Complexity results for 1-safe nets
- 1 January 1993
- book chapter
- Published by Springer Nature
- Vol. 761, 326-337
- https://doi.org/10.1007/3-540-57529-4_66
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Complexity Results for 1-safe NetsDAIMI Report Series, 1993
- Shortest paths in reachability graphsPublished by Springer Nature ,1993
- Model checking using net unfoldingsPublished by Springer Nature ,1993
- A polynomial-time algorithm to decide liveness of bounded free choice netsTheoretical Computer Science, 1992
- A survey of basic net models and modular net classesPublished by Springer Nature ,1992
- The box calculus: A new causal algebra with multi-label communicationPublished by Springer Nature ,1992
- A distributed operational semantics for CCS based on condition/event systemsActa Informatica, 1988
- Petri NetsPublished by Springer Nature ,1988
- Some Classes of Live and Safe Petri NetsPublished by Springer Nature ,1987
- Marked directed graphsJournal of Computer and System Sciences, 1971