Traps characterize home states in free choice systems

DOI10.1016/0304-3975(92)90048-KzbMath0761.68070MaRDI QIDQ1194324

Javier Esparza, Jörg Desel, Eike Best

Publication date: 27 September 1992

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

zbMATH Keywords

Petri netspolynomial-time algorithmconcurrencynondeterministic choice

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (7)

Reversible Computation vs. Reversibility in Petri Nets ⋮ Regular marked Petri nets ⋮ Structure theory of equal conflict systems ⋮ Free-choice Nets with Home Clusters are Lucent ⋮ Reachability in cyclic extended free-choice systems ⋮ Compositional generation of home states in free choice nets ⋮ Acyclic and Cyclic Reversing Computations in Petri Nets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theory of bipolar synchronization scheme
• Partial order behaviour and structure of Petri nets
• Marked directed graphs
• Synchronisationsgraphen

This page was built for publication: Traps characterize home states in free choice systems