Advertisement

Specifying timed state sequences in powerful decidable logics and timed automata

Extended abstract
  • Thomas Wilke
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 863)

Abstract

A monadic second-order language, denoted by \(\mathcal{L}d\), is introduced for the specification of sets of timed state sequences. A fragment of \(\mathcal{L}d\), denoted by
, is proved to be expressively complete for timed automata (Alur and Dill), i.e., every timed regular language is definable by a
-formula and every
-formula defines a timed regular language. As a consequence the satisfiability problem for
is decidable.
Timed temporal logics are shown to be effectively embeddable into
and hence turn out to have a decidable theory. This applies to TLГ (Manna and Pnueli) and EMITLp, which is obtained by extending the logic MITLp (Alur and Henzinger) by automata operators (Sistla, Vardi, and Wolper).
For every positive natural number k the full monadic second-order logic \(\mathcal{L}d\) and
are equally expressive modulo the set of timed state sequences of variability ≤ k. Therefore the \(\mathcal{L}d\)-theory of the set of timed state sequences of variability ≤ k is decidable.

Keywords

Regular Language Satisfiability Problem Time Automaton Distance Formula Infinite Word 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    R. Alur. “Techniques for Automatic Verification of Real-time Systems”. PhD thesis, Stanford University, California (1991).Google Scholar
  2. 2.
    R. Alur, C. Courcoubetis, and D. Dill. Model-checking in dense real-time. Inform. and Control104(1), 1–34 (1993).Google Scholar
  3. 3.
    R. Alur, C. Courcoubetis, T. A. Henzinger, and P.-H. Ho. Hybrid automata: an algorithmic approach to the specification and verification of hybrid systems. In R. L. Grossman, A. Nerode, A. P. Ravn, and H. Rischel, editors, “Hybrid Systems”, vol. 736 of “Lecture Notes in Computer Science”. Springer-Verlag, Berlin (1993).Google Scholar
  4. 4.
    R. Alur and D. Dill. A theory of timed automata. Theoret. Comput. Sci.126(2), 183–235 (1994).Google Scholar
  5. 5.
    R. Alur and D. L. Dill. Automata for modeling real-time systems. In M. S. Paterson, editor, “Automata, Languages and Programming: 17th International Colloquium”, vol. 443 of “Lecture Notes in Computer Science”, pp. 322–335, Warwick, England (1990). European Assoc. Theoret. Comput. Sci., Springer-Verlag.Google Scholar
  6. 6.
    R. Alur, T. Feder, and T. A. Henzinger. The benefits of relaxing punctuality. In “Proceedings of the 10th ACM Symposium on Principles of Distributed Computing”, pp. 139–152, Montreal, Qu ebec, Canada (1991). ACM Press.Google Scholar
  7. 7.
    R. Alur and T. Henzinger. A really temporal logic. In “Proceedings of the 30th Annual Symposium on Foundations of Computer Science”, pp. 164–169. IEEE Computer Society Press (1989).Google Scholar
  8. 8.
    R. Alur and T. Henzinger. Real-time logics: complexity and expressiveness. In “Fifth Annual IEEE Symposium on Logic in Computer Science”, pp. 390–401, Philadelphia, Pennsylvania (1990). IEEE Computer Society Press.Google Scholar
  9. 9.
    R. Alur and T. A. Henzinger. Logics and models of real-time: a survey. In J. W. de Bakker, C. Huizing, W. de Roever, and G. Rozenberg, editors, “Real-Time: Theory in Practice”, vol. 600 of “Lecture Notes in Computer Science”, pp. 74–106, Mook, The Netherlands (1991). Springer-Verlag.Google Scholar
  10. 10.
    R. Alur and T. A. Henzinger. Back to the future: towards a theory of timed regular languages. In “33rd Annual Symposium on Foundations of Computer Science”, pp. 177–186, Pittsburgh, Pennsylvania (1992). IEEE Computer Society Press.Google Scholar
  11. 11.
    R. Alur and T. A. Henzinger. Real-time logics: complexity and expressiveness. Inform. and Control104(1), 35–77 (1993).Google Scholar
  12. 12.
    J. R. Büchi. Weak second-order arithmetic and finite automata. Zeitschrift für mathematische Logik und Grundlagen der Mathematik6, 66–92 (1960).Google Scholar
  13. 13.
    J. R. Büchi. On a decision method in restricted second-order arithmetic. In E. Nagel, P. Suppes, and A. Tarski, editors, “Logic, Methodology, and Philosophy of Science: Proc. of the 1960 International Congress”, pp. 1–11. Stanford University Press (1962).Google Scholar
  14. 14.
    K. čerāns. Decidability of bisimulation equivalences for parallel timer processes. In G. v. Bochmann and D. K. Probst, editors, “Computer Aided Verification, Fourth International Workshop, CAV '92'” vol. 663 of “Lecture Notes in Computer Science”, pp. 302–315, Montreal, Canada (1992). Springer-Verlag.Google Scholar
  15. 15.
    Z. Chaochen, C. Hoare, and A. Ravn. A calculus of durations. Information Processing Letters40(5), 269–276 (1991).Google Scholar
  16. 16.
    W. Ebinger and A. Muscholl. Logical definability on infinite traces. In A. Lingas, R. Karlsson, and S. Carlsson, editors, “Automata, Languages and Programming: 20th International Colloquium”, vol. 700 of “Lecture Notes in Computer Science”, pp. 335–346, Lund, Sweden (1993). European Assoc. Theoret. Cornput. Sci., Springer-Verlag.Google Scholar
  17. 17.
    T. A. Henzinger, Z. Manna, and A. Pnueli. Timed transition systems. In J. W. de Bakker, C. Huizing, W. de Roever, and G. Rozenberg, editors, “Real-Time: Theory in Practice”, vol. 600 of “Lecture Notes in Computer Science”, pp. 226–251, Mook, The Netherlands (1991). Springer-Verlag.Google Scholar
  18. 18.
    R. Koymans, J. Vytopil, and W. P. de Roever. Real-time programming and asynchronous message passing. In “Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing”, pp. 187–197. ACM Press (1983).Google Scholar
  19. 19.
    H. R. Lewis. A logic of concrete time intervals. In “Fifth Annual IEEE Symposium on Logic in Computer Science”, pp. 380–389, Philadelphia, Pennsylvania (1990). IEEE Computer Society Press.Google Scholar
  20. 20.
    Z. Manna and A. Pnueli. Models for reactivity. Acta Information30(2), 609–678 (Oct. 1993).Google Scholar
  21. 21.
    A. Pnueli and Y. Kesten. Timed and hybrid Statecharts and their textual representation. In J. Vytopil, editor, “Formal Techniques in Real-time and Faulttolerant Systems: Second International Symposium, Nijmegen, The Netherlands”, vol. 571 of “Lecture Notes in Computer Science”, pp. 591–620, Nijmegen, The Netherlands (Jan. 1992). Springer-Verlag.Google Scholar
  22. 22.
    M. O. Rabin. Decidability of second-order theories and finite automata on infinite trees. Trans. Amer. Math. Soc.141, 1–35 (1969).Google Scholar
  23. 23.
    J. W. Thatcher and J. B. Wright. Generalized finite automata theory with an application to a decision problem of second-order arithmetic. Math. Systems Theory2(1), 57–81 (1968).Google Scholar
  24. 24.
    Th. Wilke. Automaten und Logiken zur Beschreibung zeitabhÄngiger Systeme. Technical Report 9407, Christian-Albrechts-UniversitÄt zu Kiel, Institut für Informatik und Praktische Mathematik (July 1994).Google Scholar
  25. 25.
    P. Wolper. Temporal logic can be more expressive. Inform. and Control56, 72–99 (1983).Google Scholar
  26. 26.
    P. Wolper, M. Y. Vardi, and A. P. Sistla. Reasoning about infinite computation paths. In “24th Annual Symposium on Foundations of Computer Science”, pp. 185–194. IEEE Computer Society Press (1983).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Thomas Wilke
    • 1
  1. 1.Institut für Informatik und Praktische MathematikChristian-Albrechts-UniversitÄt zu KielKielGermany

Personalised recommendations