Skip to main content
SpringerLink
Log in

Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem

  • Conference paper
  • First Online:
Automata, Languages and Programming

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

Abstract

We introduce timed alternating tree automata as a natural extension of timed automata for the purpose of solving the model checking problem for timed computation tree logic (TCTL) following the automata-theoretic approach. This settles a problem posed by Henzinger, Kupferman, and Vardi.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Alur, C. Courcoubetis, and D.L. Dill. Model-checking for real-time systems. In LICS’ 90, Philadelphia, Pennsylvania, pp. 414–425.

    Google Scholar 

  2. R. Alur, C. Courcoubetis, and D.L. Dill. Model-checking in dense real-time. Inform. and Computation, 104(1):1–34, 1993.

    Article  MathSciNet  Google Scholar 

  3. R. Alur and D.L. Dill. Automata for modeling real-time systems. In M.S. Paterson, ed., ICALP’ 90, Warwick, England, Springer, LNCS 443, pp. 322–335.

    Google Scholar 

  4. R. Alur and D.L. Dill. A theory of timed automata. Theoret. Comput. Sci., 126(2):183–235, 1994.

    Article  MathSciNet  Google Scholar 

  5. O. Bernholtz [Kupferman], M.Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. In D.L. Dill, ed., CAV’ 94, Stanford, California, Springer, LNCS 818, pp. 142–155.

    Google Scholar 

  6. M. Dickhöfer and Th. Wilke. The automata-theoretic method works for TCTL model checking. Techn. Rep. 9811, Inst. f. Informatik u. Prakt. Math., CAU Kiel, 1998. Available as http://www-i7.informatik.rwth-aachen.de/~wilke/publications/Rep9811.html.ps.gz.

  7. E.A. Emerson, C.S. Jutla, and A.P. Sistla. On model-checking for fragments of π-calculus. In C. Courcoubetis, ed., CAV’ 93, Elounda, Greece, Springer, LNCS 697, pp. 385–396.

    Google Scholar 

  8. F. Gécseg and M. Steinby. Tree Automata. Akadémiai Kiakó, Budapest, 1984.

    Google Scholar 

  9. T.A. Henzinger, O. Kupferman, and M.Y. Vardi. A space-efficient on-the-fly algorithm for real-time model checking. In U. Montanari, V. Sassone, eds., Concur’ 96, Pisa, Italy, Springer, LNCS 1119, pp. 514–529.

    Google Scholar 

  10. W. Thomas. Languages, automata and logic. In A. Salomaa and G. Rozenberg, eds., Handbook of Formal Languages, volume 3. Springer, Berlin, 1997, pp. 389–455.

    Chapter  Google Scholar 

  11. W. Thomas. Automata on infinite objects. In J.v. Leeuwen, ed., Handbook of Theoretical Computer Science, vol. B, Elsevier, Amsterdam, 1990, pp. 134–191.

    Google Scholar 

  12. M.Y. Vardi. Alternating automata and program verification. In J.v. Leeuwen, ed., Computer Science Today, Springer, 1995, LNCS 1000, pp. 471–485.

    Chapter  Google Scholar 

  13. M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In D. Kozen, ed., LICS 86, Cambridge, Mass., pp. 322–331.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität zu Kiel, 24098, Kiel, Germany

    Martin Dickhöfer

  2. Lehrstuhl für Informatik VII, RWTH Aachen, 52056, Aachen, Germany

    Thomas Wilke

Authors
  1. Martin Dickhöfer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Wilke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Computer Science, Academy of Sciences of the Czech Republic, Pod vodarenskou vezi 2, 182 07, Prague 8 - Liben, Czech Republic

    Jirí Wiedermann

  2. ILLC-WINS-University of Amsterdam, Plantage Muidergracht 24, 1018, TV, Amsterdam, The Netherlands

    Peter van Emde Boas

  3. BRICS, Department of Computer Science, University of Aarhus, Ny Munkegade, Bldg. 540, DK, 8000, Aarhus C, Denmark

    Mogens Nielsen

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dickhöfer, M., Wilke, T. (1999). Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds) Automata, Languages and Programming. Lecture Notes in Computer Science, vol 1644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48523-6_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-48523-6_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66224-2

  • Online ISBN: 978-3-540-48523-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation