Reachability in cyclic extended free-choice systems

DOI10.1016/0304-3975(93)90154-LzbMath0778.68068OpenAlexW2071268441MaRDI QIDQ685410

Javier Esparza, Jörg Desel

Publication date: 25 October 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(93)90154-l

zbMATH Keywords

boundednesslivenessPetri netscyclicity

Mathematics Subject Classification ID

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

Related Items (8)

Reversible Computation vs. Reversibility in Petri Nets ⋮ Reachability in live and safe free-choice Petri nets is NP-complete ⋮ Blocking a transition in a free choice net and what it tells about its throughput. ⋮ Regular marked Petri nets ⋮ An O(¦S¦ × ¦T¦)-algorithm to verify if a net is regular ⋮ Proving nonreachability by modulo-invariants ⋮ Structure theory of equal conflict systems ⋮ A Theory of Distributed Markov Chains

Cites Work

• Unnamed Item
• Partial order behaviour and structure of Petri nets
• Traps characterize home states in free choice systems
• Marked directed graphs
• Synchronisationsgraphen
• An Algorithm for the General Petri Net Reachability Problem

This page was built for publication: Reachability in cyclic extended free-choice systems