Finding State Solutions to Temporal Logic Queries

Different analysis problems for state-transition models can be uniformly treated as instances of temporal logic query-checking, where solutions to the queries are restricted to states. In this paper, we propose a symbolic querychecking algorithm that finds exactly the state solutions to a query. We argue that our approach generalizes previous specialized techniques, and this generality allows us to find new and interesting applications, such as finding stable states. Our algorithm is linear in the size of the state space and in the cost of model checking, and has been implemented on top of the model checker NuSMV, using the latter as a black box. We show the effectiveness of our approach by comparing it, on a gene network example, to the naive algorithm in which all possible state solutions are checked separately.

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

[2]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.

[3]  Marsha Chechik,et al.  TLQSolver: A Temporal Logic Query Checker , 2003, CAV.

[4]  Kousha Etessami,et al.  A Hierarchy of Polynomial-Time Computable Simulations for Automata , 2002, CONCUR.

[5]  Helmut Veith,et al.  A Syntactic Characterization of Distributive LTL Queries , 2004, ICALP.

[6]  Helmut Veith,et al.  Parameterized Vacuity , 2004, FMCAD.

[7]  Vincent Danos,et al.  Modeling and querying biomolecular interaction networks , 2004, Theor. Comput. Sci..

[8]  Marco Pistore,et al.  Nusmv version 2: an opensource tool for symbolic model checking , 2002, CAV 2002.

[9]  Manfred Broy,et al.  Calculational system design , 1999 .

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

[11]  Marsha Chechik,et al.  How Vacuous Is Vacuous? , 2004, TACAS.

[12]  Marsha Chechik,et al.  Multi-valued symbolic model-checking , 2003, TSEM.

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

[14]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[15]  Thomas W. Reps,et al.  Precise interprocedural dataflow analysis via graph reachability , 1995, POPL '95.

[16]  Thomas A. Henzinger,et al.  From Pre-Historic to Post-Modern Symbolic Model Checking , 1998, Formal Methods Syst. Des..

[17]  Klaus Havelund,et al.  SPIN Model Checking and Software Verification , 2000, Lecture Notes in Computer Science.

[18]  Marco Pistore,et al.  NuSMV 2: An OpenSource Tool for Symbolic Model Checking , 2002, CAV.

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

[20]  Helmut Veith,et al.  Validity of CTL Queries Revisited , 2003, CSL.

[21]  Sriram K. Rajamani,et al.  Bebop: A Symbolic Model Checker for Boolean Programs , 2000, SPIN.

[22]  C. Espinosa-Soto,et al.  A Gene Regulatory Network Model for Cell-Fate Determination during Arabidopsis thaliana Flower Development That Is Robust and Recovers Experimental Gene Expression Profilesw⃞ , 2004, The Plant Cell Online.

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

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

[25]  Orna Kupferman,et al.  Reasoning About Systems with Transition Fairness , 2005, LPAR.

[26]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[27]  Dan Suciu,et al.  Containment and equivalence for an XPath fragment , 2002, PODS.

[28]  F. Somenzi.  Binary Decision Diagrams , 1999 .

[29]  Rance Cleaveland,et al.  Efficient temporal-logic query checking for presburger systems , 2005, ASE '05.

[30]  Wojciech Penczek,et al.  Reducing model checking from multi-valued CTL* to CTL , 2002 .

[31]  Sheldon B. Akers,et al.  Binary Decision Diagrams , 1978, IEEE Transactions on Computers.

[32]  Christel Baier,et al.  CONCUR 2006 - Concurrency Theory, 17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006, Proceedings , 2006, CONCUR.

[33]  Orna Kupferman,et al.  Sanity Checks in Formal Verification , 2006, CONCUR.

[34]  Frank Wolter,et al.  Monodic fragments of first-order temporal logics: 2000-2001 A.D , 2001, LPAR.

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

[36]  Philippe Schnoebelen,et al.  On Solving Temporal Logic Queries , 2002, AMAST.

[37]  Georg Gottlob,et al.  Monadic queries over tree-structured data , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.