Finding a Witness Path for Non-liveness in Free-Choice Nets

DOI10.1007/978-3-642-21834-7_11zbMath1330.68217OpenAlexW65174931MaRDI QIDQ3011888

Harro Wimmel, Karsten Schmidt

Publication date: 29 June 2011

Published in: Applications and Theory of Petri Nets (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21834-7_11

zbMATH Keywords

Petri nettrapsiphonfree-choicecommoner-hack

Mathematics Subject Classification ID

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

Cites Work

• A structure to decide reachability in Petri nets
• Complexity of some problems in Petri nets
• Entscheidbarkeit bei Petri Netzen
• New Algorithms for Deciding the Siphon-Trap Property
• An Algorithm for the General Petri Net Reachability Problem
• Free Choice Petri Nets
• Applying CEGAR to the Petri Net State Equation