A polynomial-time algorithm to decide liveness of bounded free choice nets
- 3 August 1992
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 102 (1) , 185-205
- https://doi.org/10.1016/0304-3975(92)90299-u
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Partial order behaviour and structure of Petri netsFormal Aspects of Computing, 1990
- A polynomial newton method for linear programmingAlgorithmica, 1986
- Complexity of some problems in Petri netsTheoretical Computer Science, 1977