Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Completeness results for two-sorted metric temporal logics

  • Refereed Contributions
  • Conference paper
  • First Online:
Algebraic Methodology and Software Technology (AMAST 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 936))

  • 177 Accesses

Abstract

Temporal logic has been successfully used for modeling and analyzing the behavior of reactive and concurrent systems. One short-coming of (standard) temporal logic is that it is inadequate for real-time applications, because it only deals with qualitative timing properties. This is overcome by metric temporal logics which offer a uniform logical framework in which both qualitative and quantitative timing properties can be expressed by making use of a parameterized operator of relative temporal realization. We view metric temporal logics as two-sorted formalisms having formulae ranging over time instants and parameters ranging over an (ordered) abelian group of temporal displacements. In this paper we deal with completeness results for basic systems of metric temporal logic — such issues have largely been ignored in the literature. We first provide an axiomatization of the pure metric fragment of the logic, and prove its soundness and completeness.Then, we show how to obtain the metric temporal logic of linear orders by adding an ordering over displacements.

The first author was supported by a grant from the Italian Consiglio Nazionale delle Ricerche (CNR). The second author was supported by the Netherlands Organization for Scientific Research (NWO), project NF 102/62-356 ‘Structural and Semantic Parallels in Natural Languages and Programming Languages’. This work was carried out while the first author was visiting ILLC, University of Amsterdam.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. R. Alur and T.A. Henzinger. Real-time logics: complexity and expressiveness. Information and Computation, 104:35–77, 1993.

    Google Scholar 

  2. J.P. Burgess. Basic tense logic. In: D.M. Gabbay and F. Guenther (eds), Handbook of Philosophical Logic. Vol. 2. Dordrecht, Reidel, 1984, pages 89–134.

    Google Scholar 

  3. S. Burris and H.P. Sankappanavar. A Course in Universal Algebra. Springer, NewYork, 1981.

    Google Scholar 

  4. G. D'Agostino, A. Montanari and A. Policriti. A set-theoretic translation method for polymodal logics. In Proc. of STACS '95, LNCS 900, Springer, Berlin, 1995 217–228. To appear in Journal of Automated Reasoning.

    Google Scholar 

  5. R. Goldblatt. Logics of Time and Computation. 2nd edition. CSLI Lecture Notes No. 7, Stanford, 1992.

    Google Scholar 

  6. T.H. Henzinger. The Temporal Specification and Verification of Real-Time Systems. PhD thesis, Department of Computer Science, Stanford University, 1991.

    Google Scholar 

  7. R. Koymans. Specifying Message Passing and Time-Critical Systems with Temporal Logic. LNCS 651, Springer, Berlin, 1992. The relevant sections appeared in Journal of Real-Time Systems, 2:255–299, 1990.

    Google Scholar 

  8. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems. Springer Verlag, 1992.

    Google Scholar 

  9. A. Montanari, E. Ciapessoni, E. Corsetti and P. San Pietro. Dealing with time granularity in logical specifications of real-time systems. The synchronous case. Research Report 07/92, Università di Udine, 1992. A short version appeared in Science of Computer Programming, 20:141–171, 1993.

    Google Scholar 

  10. H.J. Ohlbach. Translation methods for non-classical logics: an overview. Bull. of the IGLP, 1:69–89, 1993.

    Google Scholar 

  11. J.S. Ostroff. Temporal Logic of Real-Time Systems. Research Studies Press, 1990.

    Google Scholar 

  12. N. Rescher and J. Garson. Topological logic. Journal of Symbolic Logic, 33:537–548, 1968.

    Google Scholar 

  13. N. Rescher and A. Urquhart. Temporal Logic. Library of Exact Philosophy, Springer-Verlag, Berlin, 1971.

    Google Scholar 

  14. M. de Rijke. The modal logic of inequality. Journal of Symbolic Logic, 57:566–584, 1992.

    Google Scholar 

  15. M. de Rijke and Y. Venema. Sahlqvist's theorem for boolean algebras with operators (with an application to cylindric algebras). Studia Logica, 54:61–78, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

V. S. Alagar Maurice Nivat

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Montanari, A., de Rijke, M. (1995). Completeness results for two-sorted metric temporal logics. In: Alagar, V.S., Nivat, M. (eds) Algebraic Methodology and Software Technology. AMAST 1995. Lecture Notes in Computer Science, vol 936. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60043-4_66

Download citation

  • DOI: https://doi.org/10.1007/3-540-60043-4_66

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60043-5

  • Online ISBN: 978-3-540-49410-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics