Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Hybrid Systems: Computation and Control

HSCC 2006: Hybrid Systems: Computation and Control pp 200–211Cite as

Decision Problems for the Verification of Real-Time Software

  • Conference paper

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

Abstract

We study two questions in the theory of timed automata concerning timed language inclusion of real-time programs modeled as timed pushdown automata in real-time specifications with just one clock. We show that if the specification B is modeled as a timed automaton with one clock, then the language inclusion problem L(A) ⊆ L(B) for a timed pushdown automaton A is decidable. On the other hand, we show that the universality problem of timed visibly pushdown automata with only one clock is undecidable. Thus there is no algorithm to check language inclusion of real-time programs for specifications given by visibly pushdown specifications with just one clock.

This research was supported in part by the grants NSF CCR-0427202 and NSF CNS-0541606.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abdulla, P.A., Čerāns, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: LICS 96: Logic in Computer Science, pp. 313–321. IEEE Press, Los Alamitos (1996)

    Google Scholar 

  2. Abdulla, P.A., Deneux, J., Ouaknine, J., Worrell, J.: Decidability and complexity results for timed automata via channel machines. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1089–1101. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  3. Abdulla, P.A., Čerāns, K., Jonsson, B., Tsay, Y.-K.: Algorithmic analysis of programs with well quasi-ordered domains. Algorithmic analysis of programs with well quasi-ordered domains 160, 109–127 (2000)

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  5. Alur, R., Etessami, K., Madhusudan, P.: A temporal logic of nested calls and returns. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 467–481. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Alur, R., Madhusudan, P.: Visibly pushdown automata. In: STOC 2004: Symposium on Theory of Computing, pp. 202–211. ACM Press, New York (2004)

    Google Scholar 

  7. Ball, T., Rajamani, S.K.: Bebop: A symbolic model checker for Boolean programs. In: Havelund, K., Penix, J., Visser, W. (eds.) SPIN 2000. LNCS, vol. 1885, pp. 113–130. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  8. 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.S. (eds.) HS 1994. LNCS, vol. 999, pp. 64–85. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  9. Dang, Z.: Pushdown timed automata: a binary reachability characterization and safety verification. Theoretical Computer Science 302, 93–121 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  10. Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere. Theoretical Computer Science 256, 63–92 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  11. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Company, Reading (1979)

    MATH  Google Scholar 

  12. Nandivada, V.K., Palsberg, J.: Timing analysis of TCP servers for surviving denial-of-service attacks. In: RTAS 2005: IEEE Real-Time and Embedded Technology and Applications Symposium, pp. 541–549. IEEE Press, Los Alamitos (2005)

    Google Scholar 

  13. Ouaknine, J., Worrell, J.: On the language inclusion problem for timed automata: Closing a decidability gap. In: LICS 2004: Logic in Computer Science, pp. 54–63. IEEE Press, Los Alamitos (2004)

    Google Scholar 

  14. Reps, T., Horwitz, S., Sagiv, M.: Precise interprocedural dataflow analysis via graph reachability. In: POPL 1995: Principles of Programming Languages, pp. 49–61. ACM Press, New York (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of California, Los Angeles, USA

    Michael Emmi & Rupak Majumdar

Authors
  1. Michael Emmi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rupak Majumdar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Center for Control, Dynamical Systems and Computation, University of California, 93106, Santa Barbara, CA, USA

    João P. Hespanha

  2. SRI International, 333 Ravenswood Ave, Menlo Park, CA, USA

    Ashish Tiwari

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Emmi, M., Majumdar, R. (2006). Decision Problems for the Verification of Real-Time Software. In: Hespanha, J.P., Tiwari, A. (eds) Hybrid Systems: Computation and Control. HSCC 2006. Lecture Notes in Computer Science, vol 3927. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11730637_17

Download citation

  • DOI: https://doi.org/10.1007/11730637_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33170-4

  • Online ISBN: 978-3-540-33171-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation