A Logical Characterization for Dense-Time Visibly Pushdown Automata

  • Devendra Bhave
  • Vrunda Dave
  • Shankara Narayanan Krishna
  • Ramchandra Phawade
  • Ashutosh Trivedi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9618)

Abstract

Two of the most celebrated results that effectively exploit visual representation to give logical characterization and decidable model-checking include visibly pushdown automata (VPA) by Alur and Madhusudan and event-clock automata (ECA) by Alur, Fix and Henzinger. VPA and ECA—by making the call-return edges visible and by making the clock-reset operation visible, respectively—recover decidability for the verification problem for pushdown automata implementation against visibly pushdown automata specification and timed automata implementation against event-clock timed automata specification, respectively. In this work we combine and extend these two works to introduce dense-time visibly pushdown automata that make both the call-return as well as resets visible. We present MSO logic characterization of these automata and prove the decidability of the emptiness problem for these automata paving way for verification problem for dense-timed pushdown automata against dense-timed visibly pushdown automata specification.

Keywords

Visibly pushdown Event-clock Logical characterization 

References

  1. 1.
    Abdulla, P., Atig, M., Stenman, J.: Dense-timed pushdown automata. In: LICS, pp. 35–44 (2012)Google Scholar
  2. 2.
    Alur, R., Dill, D.: A theory of timed automata. Theor. Comput. Sci. 126, 183–235 (1994)CrossRefMathSciNetMATHGoogle Scholar
  3. 3.
    Alur, R., Fix, L., Henzinger, T.A.: Event-clock automata: a determinizable class of timed automata. TCS 211(1–2), 253–273 (1999)CrossRefMathSciNetMATHGoogle Scholar
  4. 4.
    Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Symposium on Theory of Computing, pp. 202–211 (2004)Google Scholar
  5. 5.
    Bhave, D., Dave, V., Krishna, S.N., Phawade, R., Trivedi, A.: A logical characterization for dense-time visibly pushdown automata. Technical report, IIT Bombay (2015). http://www.cse.iitb.ac.in/internal/techreports/reports/TR-CSE-2015-77.pdf
  6. 6.
    Clemente, L., Lasota, S.: Timed pushdown automata revisited. In: LICS, pp. 738–749 (2015)Google Scholar
  7. 7.
    D’Souza, D.: A logical characterisation of event clock automata. Int. J. Found. Comput. Sci. 14(4), 625–640 (2003). http://dx.doi.org/10.1142/S0129054103001923 CrossRefMathSciNetMATHGoogle Scholar
  8. 8.
    Lautemann, C., Schwentick, T., Thérien, D.: Logics for context-free languages. In: Pacholski, L., Tiuryn, J. (eds.) Computer Science Logic. LNCS, vol. 933, pp. 205–216. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  9. 9.
    Trivedi, A., Wojtczak, D.: Recursive timed automata. In: Bouajjani, A., Chin, W.-N. (eds.) ATVA 2010. LNCS, vol. 6252, pp. 306–324. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  10. 10.
    Van Tang, N., Ogawa, M.: Event-clock visibly pushdown automata. In: Nielsen, M., Kučera, A., Miltersen, P.B., Palamidessi, C., Tůma, P., Valencia, F. (eds.) SOFSEM 2009. LNCS, vol. 5404, pp. 558–569. Springer, Heidelberg (2009)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Devendra Bhave
    • 1
  • Vrunda Dave
    • 1
  • Shankara Narayanan Krishna
    • 1
  • Ramchandra Phawade
    • 1
  • Ashutosh Trivedi
    • 1
    • 2
  1. 1.Indian Institute of Technology BombayMumbaiIndia
  2. 2.University of Colorado BoulderBoulderUSA

Personalised recommendations