New algorithms for deciding the siphon-trap property

DOI10.1007/978-3-642-13675-7_16zbMATH Open1285.68108OpenAlexW1760795249MaRDI QIDQ3569871FDOQ3569871

Authors: Olivia Oanea, Harro Wimmel, Karsten Wolf 

Publication date: 22 June 2010

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-13675-7_16

Recommendations

• Verification of siphons and traps for algebraic Petri nets
• On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity
• Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems
• scientific article; zbMATH DE number 1332966
• On liveness and controlled siphons in Petri nets

zbMATH Keywords

SATtrapsPetri netssiphonsdivide-and-conquerlivenesscommoner-hack

Mathematics Subject Classification ID

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

Cited In (9)

• Minimal trap spaces of logical models are maximal siphons of their Petri net encoding
• On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity
• Computation of strict minimal siphons in a class of Petri nets based on problem decomposition
• Taking Some Burden Off an Explicit CTL Model Checker
• Individuals, populations and fluid approximations: a Petri net based perspective
• Verification of siphons and traps for algebraic Petri nets
• Finding a witness path for non-liveness in free-choice nets
• On the fluidization of Petri nets and marking homothecy
• Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding

Uses Software

• MiniSat

This page was built for publication: New algorithms for deciding the siphon-trap property

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