Multi-valued symbolic model-checking

This article introduces the concept of multi-valued model-checking and describes a multi-valued symbolic model-checker, ΧChek. Multi-valued model-checking is a generalization of classical model-checking, useful for analyzing models that contain uncertainty (lack of essential information) or inconsistency (contradictory information, often occurring when information is gathered from multiple sources). Multi-valued logics support the explicit modeling of uncertainty and disagreement by providing additional truth values in the logic.This article provides a theoretical basis for multi-valued model-checking and discusses some of its applications. A companion article [Chechik et al. 2002b] describes implementation issues in detail. The model-checker works for any member of a large class of multi-valued logics. Our modeling language is based on a generalization of Kripke structures, where both atomic propositions and transitions between states may take any of the truth values of a given multi-valued logic. Properties are expressed in ΧCTL, our multi-valued extension of the temporal logic CTL.We define the class of logics, present the theory of multi-valued sets and multi-valued relations used in our model-checking algorithm, and define the multi-valued extensions of CTL and Kripke structures. We explore the relationship between ΧCTL and CTL, and provide a symbolic model-checking algorithm for ΧCTL. We also address the use of fairness in multi-valued model-checking. Finally, we discuss some applications of the multi-valued model-checking approach.

[1]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

[2]  J. Goguen L-fuzzy sets , 1967 .

[3]  Entailment , 1973, Philosophica.

[4]  Ryszard S. Michalski,et al.  Variable-Valued Logic and Its Applications to Pattern Recognition and Machine Learning , 1975 .

[5]  Nuel D. Belnap,et al.  A Useful Four-Valued Logic , 1977 .

[6]  Patrick Cousot,et al.  Static determination of dynamic properties of generalized type unions , 1977, Language Design for Reliable Software.

[7]  Patrick Cousot,et al.  Static determination of dynamic properties of generalized type unions , 1977 .

[8]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[9]  Brian R. Gaines,et al.  Logical foundations for database systems , 1979 .

[10]  Dexter Kozen,et al.  Results on the Propositional µ-Calculus , 1982, ICALP.

[11]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

[12]  A. P. Sistla,et al.  Automatic verification of finite-state concurrent systems using temporal logic specifications , 1986, TOPL.

[13]  Matthew L. Ginsberg,et al.  Multi-Valued Logics , 1986, AAAI.

[14]  Kim G. Larsen,et al.  A modal process logic , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[15]  Matthew L. Ginsberg,et al.  Multivalued logics: a uniform approach to reasoning in artificial intelligence , 1988, Comput. Intell..

[16]  Brian A. Davey,et al.  An Introduction to Lattices and Order , 1989 .

[17]  Robert K. Brayton,et al.  Algorithms for discrete function manipulation , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

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

[19]  Melvin Fitting,et al.  Kleene's Logic, Generalized , 1991, J. Log. Comput..

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

[21]  Somesh Jha,et al.  Verification of the Futurebus+ cache coherence protocol , 1993, Formal Methods Syst. Des..

[22]  Eric C. R. Hehner A Practical Theory of Programming , 1993, Texts and Monographs in Computer Science.

[23]  Enrico Macii,et al.  Algebraic decision diagrams and their applications , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[24]  Joanne M. Atlee,et al.  State-Based Model Checking of Event-Driven System Requirements , 1993, IEEE Trans. Software Eng..

[25]  Reiner Hähnle,et al.  Automated deduction in multiple-valued logics , 1993, International series of monographs on computer science.

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

[27]  Sérgio Vale Aguiar Campos,et al.  Symbolic Model Checking , 1993, CAV.

[28]  Dennis Dams,et al.  Abstract interpretation and partition refinement for model checking , 1996 .

[29]  Tsutomu Sasao,et al.  A method to represent multiple-output switching functions by using multi-valued decision diagrams , 1996, Proceedings of 26th IEEE International Symposium on Multiple-Valued Logic (ISMVL'96).

[30]  Christel Baier,et al.  Symbolic Model Checking for Probabilistic Processes , 1997, ICALP.

[31]  Gerard J. Holzmann,et al.  The Model Checker SPIN , 1997, IEEE Trans. Software Eng..

[32]  Orna Grumberg,et al.  Abstract interpretation of reactive systems , 1997, TOPL.

[33]  Malte Plath,et al.  SFI: a Feature Integration Tool , 1998, Tool Support for System Specification, Development and Verification.

[34]  Ralph-Johan Back,et al.  Refinement Calculus: A Systematic Introduction , 1998 .

[35]  Christel Baier,et al.  The Algebraic Mu-Calculus and MTBDDs , 1998 .

[36]  J. Dunn A Comparative Study of Various Model-Theoretic Treatments of Negation: A History of Formal Negation , 1999 .

[37]  Reinhard Wilhelm,et al.  Parametric shape analysis via 3-valued logic , 1999, POPL '99.

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

[39]  Mark Ryan,et al.  Logic in Computer Science: Modelling and Reasoning about Systems , 2000 .

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

[41]  William Chan Temporal-logic queries , 2000 .

[42]  Luca de Alfaro,et al.  Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation , 2000, TACAS.

[43]  Stephan Merz,et al.  Model Checking , 2000 .

[44]  Richard Gerber,et al.  Composite model-checking: verification with type-specific symbolic representations , 1999, TSEM.

[45]  William Chan Temporal-Locig Queries , 2000, CAV.

[46]  Michael Huth,et al.  Model-Checking View-Based Partial Specifications , 2001, MFPS.

[47]  Radha Jagadeesan,et al.  Modal Transition Systems: A Foundation for Three-Valued Program Analysis , 2001, ESOP.

[48]  Viorica Sofronie-Stokkermans,et al.  Automated Theorem Proving by Resolution for Finitely-Valued Logics Based on Distributive Lattices with Operators , 2001 .

[49]  Patrice Godefroid,et al.  Temporal logic query checking , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[50]  Radha Jagadeesan,et al.  Abstraction-Based Model Checking Using Modal Transition Systems , 2001, CONCUR.

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

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

[53]  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.

[54]  Marsha Chechik,et al.  XChek: A multi-valued model-checker , 2002 .

[55]  Marsha Chechik,et al.  Lightweight Reasoning about Program Correctness , 2001, Inf. Syst. Frontiers.

[56]  Model exploration with temporal logic query checking , 2002, SIGSOFT '02/FSE-10.

[57]  Wojciech Penczek,et al.  Reducing Model Checking from Multi-valued {\rm CTL}^{\ast} to {\rm CTL}^{\ast} , 2002, CONCUR.

[58]  Marsha Chechik,et al.  chi-Chek: A Multi-valued Model-Checker , 2002, CAV.

[59]  Benet Devereux Strong next-time operators for multiple-valued mu-calculus , 2002, FICS.

[60]  Marsha Chechik,et al.  Multi-Valued Model Checking via Classical Model Checking , 2003, CONCUR.

[61]  Marsha Chechik,et al.  CTL model-checking over logics with non-classical negations , 2003, 33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings..

[62]  Radha Jagadeesan,et al.  On the Expressiveness of 3-Valued Models , 2002, VMCAI.

[63]  Marsha Chechik,et al.  Generating Counterexamples for Multi-valued Model-Checking , 2003, FME.

[64]  Martin Peschke,et al.  Design and Validation of Computer Protocols , 2003 .

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

[66]  A. Gurfinkel,et al.  Multi-valued Symbolic Model-checking: Fairness, Counter-examples, Running Time Abstract Multi-valued Symbolic Model-checking: Fairness, Counter-examples, Running Time , 2003 .

[67]  Marsha Chechik,et al.  Temporal Logic Query Checking: A Tool for Model Exploration , 2003, IEEE Trans. Software Eng..

[68]  Scott Hazelhurst,et al.  Generating and model checking a hierarchy of abstract models , 2004, South Afr. Comput. J..

[69]  Patrick Cousot,et al.  Refining Model Checking by Abstract Interpretation , 2004, Automated Software Engineering.

[70]  Radha Jagadeesan,et al.  A domain equation for refinement of partial systems , 2004, Mathematical Structures in Computer Science.