Partitioned PLTL model-checking for refined transition systems

DOI10.1016/J.IC.2009.02.001zbMath1183.68375OpenAlexW2111670141MaRDI QIDQ1023285

E. Oudot, Pierre-Alain Masson, Jacques Julliand

Publication date: 11 June 2009

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2009.02.001

zbMATH Keywords

refinementPLTL model-checkingstate space partitioning

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Uses Software

• SPIN
• CESAR

Cites Work

• Symbolic model checking: \(10^{20}\) states and beyond
• Reasoning about infinite computations
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Computer Aided Verification
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Partitioned PLTL model-checking for refined transition systems