Expressibility results for linear-time and branching-time logics
We investigate the expressive power of linear-time and branching-time temporal logics as fragments of the logic CTL*. We give a simple characterization of those CTL* formulas that can be expressed in linear-time logic. We also give a simple method for showing that certain CTL* formulas cannot be expressed in the branching-time logic CTL. Both results are illustrated with examples.
Key wordstemporal logic linear-time logic branching-time logic computation tree logics fairness
Unable to display preview. Download preview PDF.
- E.M. Clarke A.P. Sistla. Complexity of propositional temporal logics. Journal of the Association for Computing Machinery, 32(3):733–749, July 1986.Google Scholar
- M. Ben-Ari, Z. Manna, and A. Pneuli. The temporal logic of branching time. In 8th Annual ACM Symp. on Principles of Programming Languages, pages 164–177, 1981.Google Scholar
- M. C. Browne, E. M. Clarke, and O. Grumberg. Characterizing Kripke structures in temporal logic. In 1987 Colloquium on Trees in Algebra and Programming, Pisa, Italy, March 1987.Google Scholar
- E.M. Clarke and E.A. Emerson. Synthesis of synchronization skeletons for branching time temporal logic. In Proc. of the Workshop on Logic of Programs, Springer-Verlag, Yorktown Heights, NY, 1981.Google Scholar
- E.A. Emerson and J.Y. Halpern. 'sometimes’ and ‘not never’ revisited: on branching versus linear time. In Proc. 10th ACM Symp. on Principles of Programming Languages, 1983.Google Scholar
- G.E. Hughes and M.J. Creswell. An Introduction to Modal Logic. Methuen and Co., 1977.Google Scholar
- L. Lamport. 'sometimes’ is sometimes ‘not never'. In Seventh Annual ACM Symposium on Principles of Programming Languages, pages 174–185, Association for Computing Machinery, Las Vegas, January 1980.Google Scholar
- D. E. Muller. Infinite sequences and finite machines. In Proc. 4th Annual IEEE Symposium of Switching Theory and Logical Design, pages 3–16, 1963.Google Scholar