A resolution calculus for the branching-time temporal logic CTL

The branching-time temporal logic CTL is useful for specifying systems that change over time and involve quantification over possible futures. Here we present a resolution calculus for CTL that involves the translation of formulae to a normal form and the application of a number of resolution rules. We use indices in the normal form to represent particular paths and the application of the resolution rules is restricted dependent on an ordering and selection function to reduce the search space. We show that the translation preserves satisfiability, the calculus is sound, complete, and terminating, and consider the complexity of the calculus.

[1]  Clare Dixon,et al.  CTL-Like Fragments of a Temporal Logic of Robustness , 2010, 2010 17th International Symposium on Temporal Representation and Reasoning.

[2]  E. Allen Emerson,et al.  The complexity of tree automata and logics of programs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

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

[4]  Pierre Wolper,et al.  Automata theoretic techniques for modal logics of programs: (Extended abstract) , 1984, STOC '84.

[5]  Clare Dixon,et al.  A Refined Resolution Calculus for CTL , 2009, CADE.

[6]  Joseph Y. Halpern,et al.  “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.

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

[8]  Clare Dixon,et al.  CTL-RP: A computation tree logic resolution prover , 2010, AI Commun..

[9]  Clare Dixon,et al.  Resolution for branching time temporal logics: applying the temporal resolution rule , 2000, Proceedings Seventh International Workshop on Temporal Representation and Reasoning. TIME 2000.

[10]  Alexander Bolotov,et al.  Towards gcm re-configuration - extending specification by norms , 2007, CoreGRID Workshop - Making Grids Work.

[11]  Oliver Friedmann,et al.  A Solver for Modal Fixpoint Logics , 2010, Electron. Notes Theor. Comput. Sci..

[12]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[13]  Christoph Weidenbach,et al.  System Description: SPASS Version 3.0 , 2007 .

[14]  M. Carmen Fernández Gago.  Efficient Control of Temporal Reasoning , 2000, ARW.

[15]  Will Marrero,et al.  Using BDDs to Decide CTL , 2005, TACAS.

[16]  J. A. Robinson,et al.  Automatic Deduction with Hyper-Resolution , 1983 .

[17]  Clare Dixon,et al.  Clausal temporal resolution , 1999, TOCL.

[18]  M. de Rijke,et al.  CTL model checking for processing simple XPath queries , 2004, Proceedings. 11th International Symposium on Temporal Representation and Reasoning, 2004. TIME 2004..

[19]  Stefan Schwendimann,et al.  A New One-Pass Tableau Calculus for PLTL , 1998, TABLEAUX.

[20]  Clare Dixon,et al.  Clausal resolution in a logic of rational agency , 2002, Artif. Intell..

[21]  Clare Dixon,et al.  Temporal resolution using a breadth-first search algorithm , 1998, Annals of Mathematics and Artificial Intelligence.

[22]  John Christopher McCabe-Dansted.  A Tableau for RoBCTL* , 2008, JELIA.

[23]  Rajeev Goré,et al.  The Tableaux Work Bench , 2003, TABLEAUX.

[24]  Paul C. Attie,et al.  On the Implementation Complexity of Specifications of Concurrent Programs , 2003, DISC.

[25]  Harald Ganzinger,et al.  Resolution Theorem Proving , 2001, Handbook of Automated Reasoning.

[26]  Larry J. Stockmeyer,et al.  Improved upper and lower bounds for modal logics of programs , 1985, STOC '85.

[27]  Mark Reynolds,et al.  A tableau-based decision procedure for CTL* , 2011, Formal Aspects of Computing.

[28]  Mordechai Ben-Ari,et al.  The temporal logic of branching time , 1981, POPL '81.

[29]  Vaughan R. Pratt,et al.  A Near-Optimal Method for Reasoning about Action , 1980, J. Comput. Syst. Sci..

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

[31]  Valentin Goranko,et al.  Logic in Computer Science: Modelling and Reasoning About Systems , 2007, J. Log. Lang. Inf..

[32]  Rajeev Goré,et al.  One-Pass Tableaux for Computation Tree Logic , 2007, LPAR.

[33]  Alexander Bolotov.  Clausal resolution for branching-time temporal logic , 2000 .

[34]  Lan Zhang,et al.  Clausal reasoning for branching-time logics , 2010 .

[35]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching Time Temporal Logic , 2008, 25 Years of Model Checking.

[36]  Michael Fisher,et al.  A clausal resolution method for CTL branching-time temporal logic , 1999, J. Exp. Theor. Artif. Intell..

[37]  Tim French,et al.  A Temporal Logic of Robustness , 2007, FroCoS.

[38]  Joseph Y. Halpern,et al.  Decision procedures and expressiveness in the temporal logic of branching time , 1982, STOC '82.

[39]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.

[40]  Rajeev Goré,et al.  An Experimental Comparison of Theorem Provers for CTL , 2011, 2011 Eighteenth International Symposium on Temporal Representation and Reasoning.