Model checking with strong fairness
From MaRDI portal
Publication:2505624
DOI10.1007/s10703-006-4342-yzbMath1100.68066MaRDI QIDQ2505624
Amir Pnueli, Elad Shahar, Li-On Raviv, Yonit Kesten
Publication date: 28 September 2006
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10703-006-4342-y
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
A compositional approach to CTL\(^*\) verification, \textsc{LTL} falsification in infinite-state systems, Automatic discovery of fair paths in infinite-state transition systems, Proving the existence of fair paths in infinite-state systems, Model checking with fairness assumptions using PAT, Temporal Logic and Fair Discrete Systems
Uses Software
Cites Work
- The \(\mu\)-calculus as an assertion-language for fairness arguments
- Completing the temporal picture
- Symbolic model checking: \(10^{20}\) states and beyond
- Modalities for model checking: Branching time logic strikes back
- Verification by augmented finitary abstraction
- A new heuristic for bad cycle detection using BDDs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item