Temporal Logic Can Be More Expressive

It is first proved that there are properties of sequences that are not expressible in temporal logic, even though they are easily expressible using, for instance, regular expressions. Then, it is shown how temporal logic can be extended to express any property definable by a right-linear grammar and hence a regular expression. Finally, a complete axiomatization and a decision procedure for the extended temporal logic are given and the complexity of the extended logic is examined.

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

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

[3]  Pierre Wolper,et al.  Synthesis of Communicating Processes from Temporal Logic Specifications , 1981, TOPL.

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

[5]  Albert R. Meyer,et al.  WEAK MONADIC SECOND ORDER THEORY OF SUCCESSOR IS NOT ELEMENTARY-RECURSIVE , 1973 .

[6]  Pierre Wolper,et al.  Specification and synthesis of communicating processes using an extended temporal logic: (preliminary version) , 1982, POPL '82.

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

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

[9]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

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

[11]  Amir Pnueli,et al.  Propositional dynamic logic of context-free programs , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

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

[13]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[14]  Alan C. Shaw,et al.  Software Specification Languages Based on Regular Expressions , 1980 .

[15]  Vaughan R. Pratt,et al.  Using Graphs to Understand PDL , 1981, Logic of Programs.

[16]  Zohar Manna.  Verification of Sequential Programs: Temporal Axiomatization , 1982 .

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

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

[19]  Mordechai Ben-Ari,et al.  The Temporal Logic of Branching Time , 1981, POPL.

[20]  Rina S. Cohen,et al.  Theory of omega-Languages. I. Characterizations of omega-Context-Free Languages , 1977, J. Comput. Syst. Sci..