The synthesis problem for elementary net systems is NP-complete
- 30 October 1997
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 186 (1-2) , 107-134
- https://doi.org/10.1016/s0304-3975(96)00219-8
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- The synthesis problem of Petri netsActa Informatica, 1996
- Some complexity results on transition systems and elementary net systemsTheoretical Computer Science, 1994
- PETRI NETS AND STEP TRANSITION SYSTEMSInternational Journal of Foundations of Computer Science, 1992
- Partial (set) 2-structuresActa Informatica, 1990