Skip to main content
SpringerLink
Log in

Logics for Weighted Timed Pushdown Automata

  • Chapter
  • First Online:
Book cover Fields of Logic and Computation II

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 9300))

Abstract

Weighted dense-timed pushdown automata with a timed stack were introduced by Abdulla, Atig and Stenman to model the behavior of real-time recursive systems. Motivated by the decidability of the optimal reachability problem for weighted timed pushdown automata and weighted logic of Droste and Gastin, we introduce a weighted MSO logic on timed words which is expressively equivalent to weighted timed pushdown automata. To show the expressive equivalence result, we prove a decomposition theorem which establishes a connection between weighted timed pushdown languages and visibly pushdown languages of Alur and Mudhusudan; then we apply their result about the logical characterization of visibly pushdown languages.

V. Perevoshchikov—Supported by DFG Research Training Group 1763 (QuantLA).

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

References

  1. Abdulla, P.A., Atig, M.F., Stenman, J.: Dense-timed pushdown automata. In: LICS 2012, pp. 35–44. IEEE Computer Society (2012)

    Google Scholar 

  2. Abdulla, P.A., Atig, M.F., Stenman, J.: Computing optimal reachability costs in priced dense-timed pushdown automata. In: Dediu, A.-H., Martín-Vide, C., Sierra-Rodríguez, J.-L., Truthe, B. (eds.) LATA 2014. LNCS, vol. 8370, pp. 62–75. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  4. Alur, R., Madhusudan, P.: Visibly pushdown languages. In: STOC 2004, pp. 202–211. ACM (2004)

    Google Scholar 

  5. Berstel, J.: Transductions and Context-Free Languages. Teubner Studienbücher: Informatik. Teubner, Stuttgart (1979)

    Book  MATH  Google Scholar 

  6. Bollig, B., Gastin, P.: Weighted versus probabilistic logics. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol. 5583, pp. 18–38. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  7. Bouajjani, A., Echahed, R., Robbana, R.: On the automatic verification of systems with continuous variables and unbounded discrete data structures. In: Antsaklis, P.J., Kohn, W., Nerode, A., Sastry, S. (eds.) HS 1994. LNCS, vol. 999, pp. 64–85. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  8. Bouyer, P., Fahrenberg, U., Larsen, K.G., Markey, N.: Timed automata with observers under energy constraints. In: HSCC 2010, pp. 61–70. ACM (2010)

    Google Scholar 

  9. Büchi, J.R.: Weak second order arithmetic and finite automata. Z. Math. Logik Grundlagen Informatik 6, 66–92 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  10. Dang, Z.: Pushdown timed automata: a binary reachability characterization and safety verification. Theoret. Comput. Sci. 302, 93–121 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  11. Droste, M., Gastin, P.: Weighted automata and weighted logics. Theoret. Comp. Sci. 380(1–2), 69–86 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  12. Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (2009)

    MATH  Google Scholar 

  13. Droste, M., Perevoshchikov, V.: A Nivat theorem for weighted timed automata and weighted relative distance logic. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014, Part II. LNCS, vol. 8573, pp. 171–182. Springer, Heidelberg (2014)

    Google Scholar 

  14. Droste, M., Perevoshchikov, V.: A logical characterization of timed pushdown languages. In: Beklemishev, L.D. (ed.) CSR 2015. LNCS, vol. 9139, pp. 189–203. Springer, Heidelberg (2015)

    Google Scholar 

  15. Elgot, C.C.: Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc. 98, 21–51 (1961)

    Article  MathSciNet  MATH  Google Scholar 

  16. Emmi, M., Majumdar, R.: Decision problems for the verification of real-time software. In: Hespanha, J.P., Tiwari, A. (eds.) HSCC 2006. LNCS, vol. 3927, pp. 200–211. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  17. Gurevich, Y.: Monadic theories. In: Barwise, J., Feferman, S. (eds.) Model-Theoretic Logics, pp. 479–506. Springer, Heidelberg (1985)

    Google Scholar 

  18. Lautemann, C., Schwentick, T., Thérien, D.: Logics for context-free languages. In: Pacholski, L., Tiuryn, J. (eds.) CSL 1994. LNCS, vol. 933. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  19. Mathissen, C.: Weighted logics for nested words and algebraic formal power series. Log. Methods Comput. Sci. 6(1:5), 1–34 (2010)

    MathSciNet  MATH  Google Scholar 

  20. Nivat, M.: Transductions des langages de Chomsky. Ann. de l’Inst. Fourier 18, 339–456 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  21. Quaas, K.: MSO logics for weighted timed automata. Form. Methods Syst. Des. 38(3), 193–222 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  22. Trakhtenbrot, B.A.: Finite automata and logic of monadic predicates. Doklady Akademii Nauk SSSR 140, 326–329 (1961). In Russian

    Google Scholar 

  23. Wilke, T.: Specifying timed state sequences in powerful decidable logics and timed automata. In: Langmaack, H., de Roever, W.-P., Vytopil, J. (eds.) FTRTFT 1994 and ProCoS 1994. LNCS, vol. 863, pp. 694–715. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

Download references

Acknowledgement

Yuri Gurevich’ survey article [17] was a source of inspiration for the first named author when he got interested in monadic second-order logic. Due to stimulating friendly contact since 1981, the authors would like to dedicate their paper to Yuri Gurevich.

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Leipzig, 04109, Leipzig, Germany

    Manfred Droste & Vitaly Perevoshchikov

Authors
  1. Manfred Droste
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vitaly Perevoshchikov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vitaly Perevoshchikov .

Editor information

Editors and Affiliations

  1. Steklov Mathematical Institute, Moscow, Russia

    Lev D. Beklemishev

  2. University of Michigan, Ann Arbor, Michigan, USA

    Andreas Blass

  3. Tel Aviv University, Tel Aviv, Israel

    Nachum Dershowitz

  4. Universität des Saarlandes, Saarbrücken, Germany

    Bernd Finkbeiner

  5. Microsoft Research, REDMOND, Washington, USA

    Wolfram Schulte

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Droste, M., Perevoshchikov, V. (2015). Logics for Weighted Timed Pushdown Automata. In: Beklemishev, L., Blass, A., Dershowitz, N., Finkbeiner, B., Schulte, W. (eds) Fields of Logic and Computation II. Lecture Notes in Computer Science(), vol 9300. Springer, Cham. https://doi.org/10.1007/978-3-319-23534-9_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23534-9_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23533-2

  • Online ISBN: 978-3-319-23534-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation