Concurrency, Synchronization, and Conflicts in Petri Nets

DOI10.1007/978-3-540-70844-5_4zbMath1170.68544OpenAlexW1592552608MaRDI QIDQ3602798

Hsu-Chun Yen

Publication date: 12 February 2009

Published in: Implementation and Applications of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70844-5_4

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Concurrent regular expressions and their relationship to Petri nets
• The equality problem for vector addition systems is undecidable
• The covering and boundedness problems for vector addition systems
• Separability in Conflict-Free Petri Nets
• Sequential versus concurrent languages of labeled conflict-free Petri nets

This page was built for publication: Concurrency, Synchronization, and Conflicts in Petri Nets