On stubborn sets in the verification of linear time temporal properties

DOI10.1007/s10703-005-4594-yzbMath1075.68060OpenAlexW2030867074MaRDI QIDQ1774568

Kimmo Varpaaniemi

Publication date: 17 May 2005

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

Full work available at URL: https://doi.org/10.1007/s10703-005-4594-y

zbMATH Keywords

linear time temporal logic

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44)

Related Items

The inconsistent labelling problem of stutter-preserving partial-order reduction, Unnamed Item

Cites Work

• A stubborn attack on state explosion
• Combining partial-order reductions with on-the-fly model-checking.
• Verification of distributed programs using representative interleaving sequences
• A partial order approach to branching time logic model checking.
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• 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
• Unnamed Item
• Unnamed Item