Advertisement

Decision Problems for the Verification of Real-Time Software

  • Michael Emmi
  • Rupak Majumdar
Part of the Lecture Notes in Computer Science book series (LNCS, 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.

Keywords

Input String Input Symbol Reachability Problem Input Alphabet Counter Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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)CrossRefGoogle Scholar
  3. 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)MathSciNetMATHGoogle Scholar
  4. 4.
    Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126, 183–235 (1994)MathSciNetCrossRefMATHGoogle Scholar
  5. 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)CrossRefGoogle Scholar
  6. 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. 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)CrossRefGoogle Scholar
  8. 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)CrossRefGoogle Scholar
  9. 9.
    Dang, Z.: Pushdown timed automata: a binary reachability characterization and safety verification. Theoretical Computer Science 302, 93–121 (2003)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere. Theoretical Computer Science 256, 63–92 (2001)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Company, Reading (1979)MATHGoogle Scholar
  12. 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. 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. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Michael Emmi
    • 1
  • Rupak Majumdar
    • 1
  1. 1.University of CaliforniaLos AngelesUSA

Personalised recommendations