Reachability in cyclic extended free-choice systems
From MaRDI portal
Publication:685410
DOI10.1016/0304-3975(93)90154-LzbMath0778.68068MaRDI QIDQ685410
Publication date: 25 October 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Proving nonreachability by modulo-invariants, Structure theory of equal conflict systems, 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.
Cites Work