On Stubborn Sets in the Verification of Linear Time Temporal Properties

DOI10.1007/3-540-69108-1_8zbMath1510.68045MaRDI QIDQ6487389

Kimmo Varpaaniemi

Publication date: 9 December 2022

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A stubborn attack on state explosion
• Combining partial-order reductions with on-the-fly model-checking.
• Verification of distributed programs using representative interleaving sequences
• Computer aided verification. 5th international conference, CAV '93, Elounda, Greece, June 28 - July 1, 1993. Proceedings
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• Covering step graph
• Transition Systems of Elementary Net Systems with Localities
• Relaxed visibility enhances partial order reduction
• Partial-order reduction in the weak modal mu-calculus
• Analysis of Petri nets with a dynamic priority method

This page was built for publication: On Stubborn Sets in the Verification of Linear Time Temporal Properties