scientific article; zbMATH DE number 176520

MaRDI QIDQ4035686zbMATH OpenFDO

Authors Jörg Desel, Javier Esparza

Publication date 18 May 1993

zbMATH Keywords

reachabilityfree choice Petri nets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Reachability in cyclic extended free-choice systems
• Reachability in live and safe free-choice Petri nets is NP-complete
• On the reversibility of well-behaved weighted choice-free systems
• On the Reversibility of Live Equal-Conflict Petri Nets
• Reversible computation vs. reversibility in Petri nets

Cited in

(7)

• Traps characterize home states in free choice systems
• scientific article; zbMATH DE number 4128407 (Why is no real title available?)
• Markings in perpetual free-choice nets are fully characterized by their enabled transitions
• On the reversibility of well-behaved weighted choice-free systems
• Complexity results for 1-safe nets
• Compositional generation of home states in free choice nets
• Reachability in cyclic extended free-choice systems

This page was built for publication:

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