New Algorithms for Deciding the Siphon-Trap Property
From MaRDI portal
Publication:3569871
DOI10.1007/978-3-642-13675-7_16zbMath1285.68108MaRDI QIDQ3569871
Harro Wimmel, Olivia Oanea, Karsten Schmidt
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
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding, Taking Some Burden Off an Explicit CTL Model Checker, On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity, Individuals, populations and fluid approximations: a Petri net based perspective, Minimal trap spaces of logical models are maximal siphons of their Petri net encoding, On the fluidization of Petri nets and marking homothecy, Computation of strict minimal siphons in a class of Petri nets based on problem decomposition, Finding a Witness Path for Non-liveness in Free-Choice Nets
Uses Software