Petri nets with simple circuits

DOI10.1007/3-540-45071-8_17MaRDI QIDQ3082923zbMATH OpenOpenAlexFDO

Authors Hsu-Chun Yen, Lien-Po Yu

Publication date 18 March 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45071-8_17

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Integer linear programming and the analysis of some Petri net problems
• scientific article; zbMATH DE number 1354143
• Reachability in cyclic extended free-choice systems
• On the regularity of Petri net languages
• scientific article; zbMATH DE number 762060

Cited in

(10)

• Normal Petri nets
• A unified approach for deciding the existence of certain petri net paths
• On the regularity of Petri net languages
• On complexity of reachability of transition restricted Petri nets
• scientific article; zbMATH DE number 4096792 (Why is no real title available?)
• scientific article; zbMATH DE number 176140 (Why is no real title available?)
• scientific article; zbMATH DE number 408787 (Why is no real title available?)
• scientific article; zbMATH DE number 1354143 (Why is no real title available?)
• scientific article; zbMATH DE number 7357525 (Why is no real title available?)
• Complexity results for 1-safe nets

This page was built for publication: Petri nets with simple circuits

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