A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets
- 26 April 1991
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 38 (2) , 71-76
- https://doi.org/10.1016/0020-0190(91)90225-7
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Completeness results for conflict-free vector replacement systemsJournal of Computer and System Sciences, 1988
- An O(n1.5) algorithm to decide boundedness for conflict-free vector replacement systemsInformation Processing Letters, 1987
- Properties of Conflict-Free and Persistent Petri NetsJournal of the ACM, 1978
- The covering and boundedness problems for vector addition systemsTheoretical Computer Science, 1978
- Complexity of some problems in Petri netsTheoretical Computer Science, 1977
- A decidability theorem for a class of vector-addition systemsInformation Processing Letters, 1975