Decision procedures and expressiveness in the temporal logic of branching time

In this paper we consider the Computation Tree Logic (CTL) proposed in [CE] which extends the Unified Branching Time Logic (UB) of [BMP] by adding an until operator. We establish that CTL has the small property by showing that any satisfiable CTL formulae is satisfiable in a small finite model obtained from a small -&-ldquo;pseudo-model-&-rdquo; resulting from the Fischer Ladner quotient construction. We then give an exponential time algorithm for deciding satisfiability in CTL, and extend the axiomatization of UB given in [BMP] to a complete axiomatization for CTL. Lastly, we study the relative expressive power of a family of temporal logics obtained by extending or restricting the syntax of UB and CTL.

[1]  E. A Emerson,et al.  Alternative Semantics for Temporal Logics , 1981, Theor. Comput. Sci..

[2]  Vaughan R. Pratt,et al.  Models of program logics , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[3]  Zohar Manna,et al.  The Modal Logic of Programs , 1979, ICALP.

[4]  R. Smullyan.  First-Order Logic , 1968 .

[5]  Edmund M. Clarke,et al.  Characterizing Correctness Properties of Parallel Programs Using Fixpoints , 1980, ICALP.

[6]  Karl R. Abrahamson.  Decidability and expressiveness of logics of processes , 1980 .

[7]  Leslie Lamport,et al.  "Sometime" is sometimes "not never": on the temporal logic of programs , 1980, POPL '80.

[8]  Joseph Y. Halpern,et al.  "Sometimes" and "not never" revisited: on branching versus linear time (preliminary report) , 1983, POPL '83.

[9]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[10]  Rohit Parikh,et al.  An Elementary Proof of the Completness of PDL , 1981, Theor. Comput. Sci..

[11]  E. A Emerson,et al.  Using Branching Time Logic to Synthesize Synchronization Skeletons , 1982 .

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

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

[14]  Mordechai Ben-Ari,et al.  Finite Models for Deterministic Propositional Dynamic Logic , 1981, ICALP.

[15]  Mordechai Ben-Ari,et al.  Deterministic Propositional Dynamic Logic: Finite Models, Complexity, and Completeness , 1982, J. Comput. Syst. Sci..

[16]  Robert S. Streett.  Propositional Dynamic Logic of looping and converse , 1981, STOC '81.

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

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