Abstract
We extend the classical hierarchy of branching-time temporal logics between UB and CTL * by studying which additional expressive power (if any) stems from the incorporation of past-time modalities. In addition, we propose a new temporal combinator, N for “Now”, that brings new and interesting expressive power. In several situations, non-trivial translation algorithms exist from a temporal logic with past to a pure-future fragment. These algorithms have important practical applications e.g. in the field of model-checking.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Ben-Ari, A. Pnueli, and Z. Manna. The temporal logic of branching time. Acta Informatica, 20:207–226, 1983.
E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proc. Logics of Programs Workshop, Yorktown Heights, LNCS 131, pages 52–71. Springer-Verlag, May 1981.
E. Chang, Z. Manna, and A. Pnueli. Characterization of temporal property classes. In Proc. 19th ICALP, Vienna, LNCS 623, pages 474–486. Springer-Verlag, July 1992.
E. A. Emerson and E. M. Clarke. Characterizing correctness properties of parallel programs using fixpoints. In Proc. 7th ICALP, Noordwijkerhout, LNCS 85, pages 169–181. Springer-Verlag, July 1980.
E. A. Emerson and J. Y. Halpern. Decision procedures and expressiveness in the temporal logic of branching time. Journal of Computer and System Sciences, 30(1):1–24, 1985.
E. A. Emerson and J. Y. Halpern. “Sometimes” and “Not Never” revisited: On branching versus linear time temporal logic. Journal of the ACM, 33(1):151–178, 1986.
E. A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, vol. B, chapter 16, pages 995–1072. Elsevier Science Publishers, 1990.
D. Gabbay. The declarative past and imperative future: Executable temporal logic for interactive systems. In Proc. Temporal Logic in Specification, Altrincham, UK, LNCS 398, pages 409–448. Springer-Verlag, April 1987.
D. Gabbay, A. Pnueli, S. Shelah, and J. Stavi. On the temporal analysis of fairness. In Proc. 7th ACM Symp. Principles of Programming Languages, Las Vegas, Nevada, pages 163–173, January 1980.
T. Hafer and W. Thomas. Computation tree logic CTL * and path quantifiers in the monadic theory of the binary tree. In Proc. 14th ICALP, Karlsruhe, LNCS 267, pages 269–279. Springer-Verlag, July 1987.
F. Laroussinie, S. Pinchinat, and Ph. Schnoebelen. Translation results for modal logics of reactive systems. In Proc. AMAST'93, Enschede, NL, pages 299–310. Springer-Verlag, June 1993.
O. Lichtenstein, A. Pnueli, and L. Zuck. The glory of the past. In Proc. Logics of Programs Workshop, Brooklyn, LNCS 193, pages 196–218. Springer-Verlag, June 1985.
L. E. Moser, P. M. Melliar-Smith, G. Kutty, and Y. S. Ramakrishna. Completeness and soundness of axiomatizations for temporal logics without next. Fundamenta Informaticae, 1993. To appear.
Z. Manna and A. Pnueli. The anchored version of the temporal framework. In Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Noordwijkerhout, LNCS 354, pages 201–284. Springer-Verlag, 1989.
Z. Manna and A. Pnueli. A hierarchy of temporal properties. In Proc. 9th ACM Symp. Principles of Distributed Computing, Quebec City, Canada, pages 377–408, August 1990.
Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurent Systems, volume I: Specification. Springer-Verlag, 1992.
M. Vardi. A temporal fixpoint calculus. In Proc. 15th ACM Symp. Principles of Programming Languages, San Diego, CA, pages 250–259, January 1988.
L. Zuck. Past Temporal Logic. PhD thesis, Weizmann Institute, Rehovot, Israel, August 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Laroussinie, F., Schnoebelen, P. (1994). A hierarchy of temporal logics with past. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds) STACS 94. STACS 1994. Lecture Notes in Computer Science, vol 775. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57785-8_130
Download citation
DOI: https://doi.org/10.1007/3-540-57785-8_130
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57785-0
Online ISBN: 978-3-540-48332-8
eBook Packages: Springer Book Archive