Formula-Dependent Equivalence for Compositional CTL Model Checking

We present a polytime computable state equivalence that is defined with respect to a given CTL formula. Since it does not attempt to preserve all CTL formulas, like bisimulation does, we can expect to compute coarser equivalences. This equivalence can be used to reduce the complexity of model checking a system of interacting FSMs. Additionally, we show that in some cases our techniques can detect if a formula passes or fails, without forming the entire product machine. The method is exact and fully automatic, and handles full CTL.

[1]  Adnan Aziz,et al.  Formula-Dependent Equivalence for Compositional CTL Model Checking , 1994, CAV.

[2]  Orna Grumberg,et al.  Model checking and modular verification , 1994, TOPL.

[3]  Edmund M. Clarke,et al.  Characterizing Kripke Structures in Temporal Logic , 1987, TAPSOFT, Vol.1.

[4]  Olivier Coudert,et al.  Verification of Synchronous Sequential Machines Based on Symbolic Execution , 1989, Automatic Verification Methods for Finite State Systems.

[5]  R. Brayton,et al.  Automatic compositional minimization in CTL model checking , 1992, 1992 IEEE/ACM International Conference on Computer-Aided Design.

[6]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[7]  Nicolas Halbwachs,et al.  Minimal Model Generation , 1990, CAV.

[8]  Chin-Laung Lei,et al.  Modalities for model checking (extended abstract): branching time strikes back , 1985, POPL.

[9]  E. Emerson,et al.  Modalities for model checking (extended abstract): branching time strikes back , 1985, ACM-SIGACT Symposium on Principles of Programming Languages.

[10]  Nicolas Halbwachs,et al.  Minimal State Graph Generation , 1992, Science of Computer Programming.

[11]  Orna Grumberg,et al.  Generation of Reduced Models for Checking Fragments of CTL , 1993, CAV.

[12]  Robert K. Brayton,et al.  Verifying Interacting Finite State Machines , 1993 .

[13]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[14]  Robert K. Brayton,et al.  Heuristic Minimization of BDDs Using Don't Cares , 1994, 31st Design Automation Conference.

[15]  Edmund M. Clarke,et al.  Characterizing Finite Kripke Structures in Propositional Temporal Logic , 1988, Theor. Comput. Sci..

[16]  Robert K. Brayton,et al.  Automatic compositional minimization in CTL model checking , 1992, ICCAD.

[17]  Edmund M. Clarke,et al.  Compositional model checking , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.