Reducing Model Checking from Multi-valued {\rm CTL}^{\ast} to {\rm CTL}^{\ast}

A multi-valued version of CTL* (mv-CTL*), where both the propositions and the accessibility relation are multi-valued taking values in a finite quasi-boolean algebra, is considered. A general translation from mv-CTL* to CTL* model checking is defined. An application of the translation is shown for the most commonly used quasi-boolean algebras.

[1]  Marsha Chechik,et al.  Implementing a Multi-valued Symbolic Model Checker , 2001, TACAS.

[2]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[3]  Marsha Chechik,et al.  A framework for multi-valued reasoning over inconsistent viewpoints , 2001, Proceedings of the 23rd International Conference on Software Engineering. ICSE 2001.

[4]  S. Hazelhurst,et al.  Compositional Model Checking of Partially Ordered State Spaces , 1996 .

[5]  W. Penczek,et al.  Model checking for multi-valued computation tree logics , 2003 .

[6]  Melvin Fitting,et al.  Many-valued modal logics , 1991, Fundam. Informaticae.

[7]  Doron A. Peled.  Partial order reduction: Linear and branching temporal logics and process algebras , 1996, Partial Order Methods in Verification.

[8]  Marsha Chechik,et al.  Efficient Multiple-Valued Model-Checking Using Lattice Representations , 2001, CONCUR.

[9]  Wojciech Penczek,et al.  A partial order approach to branching time logic model checking , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[10]  Armin Biere,et al.  Symbolic Model Checking without BDDs , 1999, TACAS.

[11]  Hergen Pargmann,et al.  Model Checking Using Adaptive State and Data Abstraction , 1994, CAV.

[12]  Somesh Jha,et al.  Exploiting Symmetry In Temporal Logic Model Checking , 1993, CAV.

[13]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[14]  Wojciech Penczek,et al.  Branching Time Bounded Model Checking for Elementary Net Systems , 2001 .

[15]  Wojciech Penczek,et al.  Bounded Model Checking for the Universal Fragment of CTL , 2002, Fundam. Informaticae.

[16]  A. Prasad Sistla,et al.  Symmetry and model checking , 1996, Formal Methods Syst. Des..

[17]  Marsha Chechik,et al.  Model-Checking over Multi-valued Logics , 2001, FME.

[18]  Marsha Chechik,et al.  Model-checking infinite state-space systems with fine-grained abstractions using SPIN , 2001, SPIN '01.

[19]  Patrice Godefroid,et al.  Generalized Model Checking: Reasoning about Partial State Spaces , 2000, CONCUR.

[20]  Melvin Fitting,et al.  Many-valued modal logics II , 1992 .

[21]  R. Bryant.  Binary decision diagrams and beyond: enabling technologies for formal verification , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[22]  Kenneth L. McMillan,et al.  A technique of state space search based on unfolding , 1995, Formal Methods Syst. Des..

[23]  Wojciech Penczek,et al.  Towards Bounded Model Checking for the Universal Fragment of TCTL , 2002, FTRTFT.

[24]  Patrice Godefroid,et al.  Model Checking Partial State Spaces with 3-Valued Temporal Logics , 1999, CAV.

[25]  Antti Valmari,et al.  Stubborn sets for reduced state space generation , 1991, Applications and Theory of Petri Nets.

[26]  Wojciech Penczek,et al.  Improving Partial Order Reductions for Universal Branching Time Properties , 2000, Fundam. Informaticae.