Reachability in live and safe free-choice Petri nets is NP-complete
From MaRDI portal
Publication:1129263
DOI10.1016/S0304-3975(97)00235-1zbMath0902.68136OpenAlexW2018409411MaRDI QIDQ1129263
Publication date: 13 August 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00235-1
Related Items
Static analysis and stochastic search for reachability problem ⋮ Free-choice Nets with Home Clusters are Lucent ⋮ Soundness of workflow nets: classification, decidability, and analysis
Cites Work