SOME COMPLEXITY RESULTS FOR RINGS OF PETRI NETS

DOI10.1142/S0129054194000153MaRDI QIDQ4853328zbMATH OpenFDO

Authors Hsu-Chun Yen, Bow-Yaw Wang, Ming-Shang Yang

Publication date 29 October 1995

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054194000153

zbMATH Keywords

cyclic communicating finite state machinesPetri nets

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 4037227
• Reachability in cyclic extended free-choice systems
• An Algorithm for the General Petri Net Reachability Problem
• Analyzing Reachability for Some Petri Nets With Fast Growing Markings
• A multiparameter analysis of the boundedness problem for vector addition systems

Cited in

(4)

• A multiparameter analysis of the boundedness problem for vector addition systems
• Complexity results for problems of communication-free Petri nets and related formalisms
• scientific article; zbMATH DE number 4037227 (Why is no real title available?)
• The reachability problem for Petri nets is not elementary

This page was built for publication: SOME COMPLEXITY RESULTS FOR RINGS OF PETRI NETS

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