The Temporal Logic of Branching Time

A temporal language and system are presented which are based on branching time structure. By the introduction of symmetrically dual sets of temporal operators, it is possible to discuss properties which hold either along one path or along all paths. Consequently it is possible to express in this system all the properties that were previously expressible in linear time or branching time systems. We present an exponential decision procedure for satisfiability in the language based on tableaux methods, and a complete deduction system. As associated temporal semantics is illustrated for both structured and graph representation of programs.

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

[2]  David Harel,et al.  Process Logic: Expressiveness, Decidability, Completeness , 1980, FOCS.

[3]  Fred Kröger,et al.  A Uniform Logical Basis for the Description, Specification and Verification of Programs , 1977, Formal Description of Programming Concepts.

[4]  Karl R. Abrahamson.  Modal Logic of Concurrent Nondeterministic Programs , 1979, Semantics of Concurrent Computation.

[5]  Vaughan R. Pratt.  A practical decision method for propositional dynamic logic (Preliminary Report) , 1978, STOC '78.

[6]  Alasdair Urquhart,et al.  Temporal Logic , 1971 .

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

[8]  Zohar Manna.  Second-order mathematical theory of computation , 1970, STOC '70.

[9]  David Harel,et al.  First-Order Dynamic Logic , 1979, Lecture Notes in Computer Science.

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

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

[12]  Robert W. Floyd,et al.  Nondeterministic Algorithms , 1967, JACM.

[13]  Max J. Cresswell,et al.  A New Introduction to Modal Logic , 1998 .

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

[15]  Zohar Manna.  Mathematical Theory of Partial Correctness , 1971, J. Comput. Syst. Sci..

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

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

[18]  Edsger W. Dijkstra,et al.  Guarded commands, nondeterminacy and formal derivation of programs , 1975, Commun. ACM.

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

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