Efficient on-the-fly model-checking for regular alternation-free mu-calculus

  • Authors:
  • Radu Mateescu;Mihaela Sighireanu

  • Affiliations:
  • INRIA Rhône-Alpes/VASY, 655, avenue de l'Europe, F-38330 Montbonnot Saint Martin, France;Université Paris 7/LIAFA, 2, place Jussieu, F-75251 Paris, France

  • Venue:
  • Science of Computer Programming - Special issure on formal methods for industrial critical systems (FMICS 2000)
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Model-checking is a successful technique for automatically verifying concurrent finite-state systems. When designing a model-checker, a good compromise must be made between the expressive power of the property description formalism, the complexity of the model-checking problem, and the user-friendliness of the interface. We present a temporal logic and an associated model-checking method that attempt to fulfill these criteria. The logic is an extension of the alternation-free µ-calculus with ACTL-like action formulas and PDL-like regular expressions, allowing a concise and intuitive description of safety, liveness, and fairness properties over labeled transition systems. The model-checking method is based upon a succinct translation of the verification problem into a boolean equation system, which is solved by means of an efficient local algorithm having a good average complexity. The algorithm also allows to generate full diagnostic information (examples and counterexamples) for temporal formulas. This method is at the heart of the EVALUATOR 3.0 model-checker that we implemented within the CADP toolbox using the generic OPEN/CAESAR environment for on-the-fly verification.