Question-guided stubborn set methods for state properties

DOI10.1007/S10703-006-0006-1MaRDI QIDQ862861zbMATH OpenOpenAlexFDO

Authors Lars M. Kristensen, Karsten Wolf, Antti Valmari

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)

Recommendations

• scientific article; zbMATH DE number 1696461
• scientific article; zbMATH DE number 1278351
• On Stubborn Sets in the Verification of Linear Time Temporal Properties
• Publication:4507831
• On stubborn sets in the verification of linear time temporal properties

Cites work

• scientific article; zbMATH DE number 1696461 (Why is no real title available?)
• scientific article; zbMATH DE number 1696471 (Why is no real title available?)
• scientific article; zbMATH DE number 3870578 (Why is no real title available?)
• scientific article; zbMATH DE number 3906496 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 177511 (Why is no real title available?)
• scientific article; zbMATH DE number 1302043 (Why is no real title available?)
• scientific article; zbMATH DE number 1059329 (Why is no real title available?)
• scientific article; zbMATH DE number 1142326 (Why is no real title available?)
• scientific article; zbMATH DE number 2087625 (Why is no real title available?)
• A partial order approach to branching time logic model checking.
• Computer Aided Verification
• Correct Hardware Design and Verification Methods
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• Petri nets with individual tokens
• Relaxed visibility enhances partial order reduction
• State space reduction using partial order techniques
• The temporal semantics of concurrent programs
• Using partial orders for the efficient verification of deadlock freedom and safety properties

Cited in

(9)

• On the Computation of Stubborn Sets of Colored Petri Nets
• scientific article; zbMATH DE number 1696461 (Why is no real title available?)
• Stubborn versus structural reductions for Petri nets
• Taking Some Burden Off an Explicit CTL Model Checker
• Applying CEGAR to the Petri net state equation
• Transparent partial order reduction
• An efficient algorithm for the computation of stubborn sets of well formed Petri nets
• Experimenting with stubborn sets on Petri nets
• Finding Stubborn Sets of Coloured Petri Nets without Unfolding

Describes a project that uses

Uses Software

• CESAR
• BPEL2PN
• LoLA
• SPIN
• Zing

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

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