Temporal resolution using a breadth-first search algorithm

An approach to applying clausal resolution, a proof method well suited to mechanisation, to temporal logics has been developed by Fisher. The method involves translation to a normal form, classical style resolution within states, and temporal resolution between states. Not only has it been shown to be correct but as it consists of only one temporal resolution rule, it is particularly suitable as the basis of an automated temporal resolution theorem prover. As the application of the temporal resolution rule is the most costly part of the method, it is on this area that we focus. Detailed algorithms for abreadth‐first search approach to the application of this rule are presented. Correctness is shown and complexity given. Analysis of the behaviour of the algorithms is carried out and we explain why this approach is an improvement to others suggested.

[1]  Gary L. Peterson,et al.  Myths About the Mutual Exclusion Problem , 1981, Inf. Process. Lett..

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

[3]  Ana R. Cavalli,et al.  A Decision Method for Linear Temporal Logic , 1984, CADE.

[4]  Zohar Manna,et al.  Verification of concurrent programs, Part I: The temporal framework , 1981 .

[5]  Michael Fisher,et al.  Executable Model and Temporal Logics: Proceedings of the IJCAI '93 Workshop, Chambery, France, August 28, 1993 , 1995 .

[6]  Martín Abadi,et al.  Nonclausal deduction in first-order temporal logic , 1990, JACM.

[7]  Zohar Manna,et al.  Temporal Verification of Reactive Systems , 1995, Springer New York.

[8]  Leslie Lamport,et al.  Proving Liveness Properties of Concurrent Programs , 1982, TOPL.

[9]  Michael Fisher,et al.  Transformation and Synthesis in METATEM Part I: Propositional METATEM , 1992 .

[10]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[11]  Johan Anthory Willem Kamp,et al.  Tense logic and the theory of linear order , 1968 .

[12]  Saharon Shelah,et al.  On the temporal analysis of fairness , 1980, POPL '80.

[13]  Amir Pnueli,et al.  Now you may compose temporal logic specifications , 1984, STOC '84.

[14]  Michael Wooldridge,et al.  On the Formal Specification and Verification of Multi-Agent Systems , 1997, Int. J. Cooperative Inf. Syst..

[15]  Mats Carlsson,et al.  SICStus Prolog User''s Manual , 1993 .

[16]  Howard Barringer.  The use of temporal logic in the compositional specification of concurrent systems , 1987 .

[17]  G. Venkatesh,et al.  A Decision Method for Temporal Logic Based on Resolution , 1985, FSTTCS.

[18]  Amir Pnueli,et al.  In Transition From Global to Modular Temporal Reasoning about Programs , 1989, Logics and Models of Concurrent Systems.

[19]  Leslie Lamport,et al.  Specifying Concurrent Program Modules , 1983, TOPL.

[20]  Michael Wooldridge,et al.  A Resolution-Based Proof Method for Temporal Logics of Knowledge and Belief , 1996, FAPR.

[21]  Clare Dixon,et al.  Temporal resolution: removing irrelevant information , 1997, Proceedings of TIME '97: 4th International Workshop on Temporal Representation and Reasoning.

[22]  Brent Hailpern.  Verifying Concurrent Processes Using Temporal Logic , 1982, Lecture Notes in Computer Science.

[23]  Amir Pnueli.  The Temporal Semantics of Concurrent Programs , 1981, Theor. Comput. Sci..

[24]  Robert A. Kowalski,et al.  Logic for problem solving , 1982, The computer science library : Artificial intelligence series.

[25]  Martín Abadi,et al.  Temporal-logic theorem proving , 1987 .

[26]  Michael Fisher,et al.  A Normal Form for First-Order Temporal Formulae , 1992, CADE.

[27]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[28]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[29]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[30]  Benjamin Charles Moszkowski.  Reasoning about Digital Circuits , 1983 .

[31]  Clare Dixon,et al.  Search Strategies for Resolution in Temporal Logics , 1996, CADE.

[32]  William McCune,et al.  OTTER 1.0 Users' Guide , 1990 .

[33]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[34]  Robert A. Kowalski,et al.  Predicate Logic as Programming Language , 1974, IFIP Congress.

[35]  Michael Fisher,et al.  A resolution method for CTL branching-time temporal logic , 1997, Proceedings of TIME '97: 4th International Workshop on Temporal Representation and Reasoning.

[36]  Zohar Manna,et al.  Temporal verification of reactive systems - safety , 1995 .

[37]  Pierre Wolper,et al.  The tableau method for temporal logic: an overview , 1985 .

[38]  Clare Dixon.  Strategies for Temporal Resolution , 1995 .

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

[40]  Amir Pnueli,et al.  Applications of Temporal Logic to the Specification and Verification of Reactive Systems: A Survey of Current Trends , 1986, Current Trends in Concurrency.

[41]  Michael Fisher,et al.  A Resolution Method for Temporal Logic , 1991, IJCAI.

[42]  Joseph Y. Halpern.  USING REASONING ABOUT KNOWLEDGE TO ANALYZE DISTRIBUTED SYSTEMS , 1987 .