Question-guided stubborn set methods for state properties

DOI10.1007/s10703-006-0006-1zbMath1109.68075OpenAlexW2076703513MaRDI QIDQ862861

Karsten Schmidt, Antti Valmari, Lars Michael Kristensen

Publication date: 24 January 2007

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10703-006-0006-1

zbMATH Keywords

Petri netsPartial-order reductionState explosion problemState space methodsStubborn set methods

Mathematics Subject Classification ID

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

Related Items (4)

Stubborn versus structural reductions for Petri nets ⋮ Taking Some Burden Off an Explicit CTL Model Checker ⋮ Transparent partial order reduction ⋮ Applying CEGAR to the Petri Net State Equation

Uses Software

• Zing
• SPIN
• LoLA
• BPEL2PN
• CESAR

Cites Work

• Petri nets with individual tokens
• The temporal semantics of concurrent programs
• Using partial orders for the efficient verification of deadlock freedom and safety properties
• A partial order approach to branching time logic model checking.
• State space reduction using partial order techniques
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• Computer Aided Verification
• Correct Hardware Design and Verification Methods
• Relaxed visibility enhances partial order reduction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Question-guided stubborn set methods for state properties