scientific article; zbMATH DE number 862267

zbMATH Open0842.68051MaRDI QIDQ4871503FDOQ4871503

Authors: V. V. Bayev 

Publication date: 21 May 1996

Title of this publication is not available (Why is that?)

Recommendations

• Reachability in live and safe free-choice Petri nets is NP-complete
• On complexity of reachability of transition restricted Petri nets
• Complexity results for 1-safe nets
• scientific article; zbMATH DE number 1354143
• scientific article; zbMATH DE number 4215383

zbMATH Keywords

SP machine

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4871503)