A solution to the covering problem for 1-bounded conflict-free Petri nets using Linear Programming
- 17 April 1992
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 41 (6) , 313-319
- https://doi.org/10.1016/0020-0190(92)90158-r
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri netsInformation Processing Letters, 1991
- Petri nets: Properties, analysis and applicationsProceedings of the IEEE, 1989
- 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