Temporal logic can be more expressive

We start by proving that some properties of sequences are not expressible in Temporal Logic though they are expressible using for instance regular expressions. Then, we show how Temporal Logic can be extended to express any such property definable by a right-linear grammar and hence a regular expression, Finally, we give a decision procedure and complete axiomatization for the extended Temporal Logic.

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

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

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

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

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

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