Skip to main content
SpringerLink
Log in

Weak Alternating Timed Automata

  • Conference paper
Automata, Languages and Programming (ICALP 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5556))

Included in the following conference series:

Abstract

Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for the automata is decidable. This result implies new decidability results for fragments of timed temporal logics. It is also shown that, unlike for MITL, the characterisation remains the same even if no punctual constraints are allowed.

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. Abdulla, P., Jonsson, B.: Veryfying networks of timed processes. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol. 1384, pp. 298–312. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  2. Abdulla, P., Jonsson, B.: Timed Petri nets and BQOs. In: Colom, J.-M., Koutny, M. (eds.) ICATPN 2001. LNCS, vol. 2075, pp. 53–70. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  3. Abdulla, P.A., Deneux, J., Ouaknine, J., Quaas, K., Worrell, J.: Universality analysis for one-clock timed automata. Fundam. Inform. 89(4), 419–450 (2008)

    MathSciNet  MATH  Google Scholar 

  4. Abdulla, P.A., Ouaknine, J., Quaas, K., Worrell, J.: Zone-based universality analysis for single-clock timed automata. In: Arbab, F., Sirjani, M. (eds.) FSEN 2007. LNCS, vol. 4767, pp. 98–112. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  5. Alur, R., Dill, D.: A theory of timed automata. Theoretical Computer Science 126, 183–235 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  6. Alur, R., Feder, T., Henzinger, T.A.: The benefits of relaxing punctuality. J. ACM 43(1), 116–146 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  7. Alur, R., Fix, L., Henzinger, T.: Event-clock automata: A determinizable class of timed automata. Theoretical Computer Science 204 (1997)

    Google Scholar 

  8. Alur, R., Henzinger, T.A.: A really temporal logic. J. ACM 41(1), 181–204 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  9. Bouyer, P.: Model-checking timed temporal logics. In: Workshop on Methods for Modalities (M4M-5), Cachan, France. Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, Amsterdam (2009)

    Google Scholar 

  10. Bouyer, P., Chevalier, F., Markey, N.: On the expressiveness of TPTL and MTL. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 432–443. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  11. Bouyer, P., Markey, N., Ouaknine, J., Worrell, J.: The cost of punctuality. In: LICS, pp. 109–120 (2007)

    Google Scholar 

  12. Bouyer, P., Markey, N., Ouaknine, J., Worrell, J.: On expressiveness and complexity in real-time model checking. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 124–135. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  13. Hirshfeld, Y., Rabinovich, A.M.: Logics for real time: Decidability and complexity. Fundam. Inform. 62(1), 1–28 (2004)

    MathSciNet  MATH  Google Scholar 

  14. Hung, D.V., Ji, W.: On the design of hybrid control systems using automata models. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol. 1180, pp. 156–167. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  15. Lasota, S., Walukiewicz, I.: Alternating timed automata. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 250–265. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  16. Lasota, S., Walukiewicz, I.: Alternating timed automata. ACM Trans. Comput. Log. 9(2) (2008)

    Google Scholar 

  17. Mostowski, A.W.: Hierarchies of weak automata and week monadic formulas. Theoretical Computer Science 83, 323–335 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  18. Murlak, F.: Weak index versus borel rank. In: STACS, Dagstuhl Seminar Proceedings, pp. 573–584. Dagsr (2008)

    Google Scholar 

  19. Ouaknine, J., Worrell, J.: On the language inclusion problem for timed automata: Closing a decidability gap. In: Proc. LICS 2004, pp. 54–63 (2004)

    Google Scholar 

  20. Ouaknine, J., Worrell, J.: On the decidability of metric temporal logic. In: LICS, pp. 188–197 (2005)

    Google Scholar 

  21. Ouaknine, J., Worrell, J.: On metric temporal logic and faulty Turing machines. In: Aceto, L., Ingólfsdóttir, A. (eds.) FOSSACS 2006. LNCS, vol. 3921, pp. 217–230. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  22. Ouaknine, J., Worrell, J.: Safety metric temporal logic is fully decidable. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 411–425. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  23. Ouaknine, J., Worrell, J.: On the decidability and complexity of metric temporal logic over finite words. Logical Methods in Computer Science 3(1) (2007)

    Google Scholar 

  24. Ouaknine, J., Worrell, J.: Some recent results in metric temporal logic. In: Cassez, F., Jard, C. (eds.) FORMATS 2008. LNCS, vol. 5215, pp. 1–13. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  25. Parys, P., Walukiewicz, I.: Weak alternating timed automata. HAL (2009), http://hal.archives-ouvertes.fr/hal-00360122/fr/

  26. Vardi, M.Y., Wolper, P.: Automata theoretic techniques for modal logics of programs. In: Sixteenth ACM Symposium on the Theoretical Computer Science (1984)

    Google Scholar 

  27. Wagner, K.: Eine topologische Charakterisierung einiger Klassen regulärer Folgenmengen. J. Inf. Process. Cybern. EIK 13, 473–487 (1977)

    MATH  Google Scholar 

  28. Wagner, K., Staiger, L.: Automatentheoretische und automatenfreie charakterisierungen topologischer klassen regularer folgenmengen. EIK 10, 379–392 (1974)

    MathSciNet  MATH  Google Scholar 

  29. Wilke, T.: Classifying discrete temporal properties. Habilitation thesis, Kiel, Germany (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Warsaw University, Poland

    Pawel Parys

  2. LaBRI, CNRS and Bordeaux University, France

    Igor Walukiewicz

Authors
  1. Pawel Parys
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Igor Walukiewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Freiburg, Georges Köhler Allee 79, 79110, Freiburg, Germany

    Susanne Albers

  2. Department of Computer and Systems Sciences, Sapienza University of Rome, Via Ariosto 25, 00184, Roma, Italy

    Alberto Marchetti-Spaccamela

  3. Tel Aviv University Google R&D Center, School of Computer Science, Tel Aviv University, 69978, Tel Aviv, Israel

    Yossi Matias

  4. University of Patras and CTI, N. Kazantzaki Street 1, 26504, Rion, Patras, Greece

    Sotiris Nikoletseas

  5. RWTH Aachen, Lehrstuhl Informatik 7, Ahornstraße 55, 52056, Aachen, Germany

    Wolfgang Thomas

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Parys, P., Walukiewicz, I. (2009). Weak Alternating Timed Automata. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds) Automata, Languages and Programming. ICALP 2009. Lecture Notes in Computer Science, vol 5556. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02930-1_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02930-1_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02929-5

  • Online ISBN: 978-3-642-02930-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation