International Conference on Formal Modeling and Analysis of Timed Systems

FORMATS 2015: Formal Modeling and Analysis of Timed Systems pp 189-205 | Cite as

Nested Timed Automata with Frozen Clocks

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9268)

Abstract

A nested timed automaton (NeTA) is a pushdown system whose control locations and stack alphabet are timed automata (TAs). A control location describes a working TA, and the stack presents a pile of interrupted TAs. In NeTAs, all local clocks of TAs proceed uniformly also in the stack. This paper extends NeTAs with frozen local clocks (NeTA-Fs). All clocks of a TA in the stack can be either frozen or proceeding when it is pushed. A NeTA-F also allows global clocks adding to local clocks in the working TA, which can be referred and/or updated from the working TA. We investigate the reachability of NeTA-Fs showing that (1) the reachability with a single global clock is decidable, and (2) the reachability with multiple global clocks is undecidable.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alur, R., Dill, D.L.: A Theory of Timed Automata. Theoretical Computer Science 126, 183–235 (1994)CrossRefMathSciNetMATHGoogle Scholar
  2. 2.
    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
  3. 3.
    Benerecetti, M., Minopoli, S., Peron, A.: Analysis of timed recursive state machines. In: TIME 2010, pp. 61–68. IEEE (2010)Google Scholar
  4. 4.
    Li, G., Cai, X., Ogawa, M., Yuen, S.: Nested timed automata. In: Braberman, V., Fribourg, L. (eds.) FORMATS 2013. LNCS, vol. 8053, pp. 168–182. Springer, Heidelberg (2013) CrossRefGoogle Scholar
  5. 5.
    Cassez, F., Larsen, K.G.: The impressive power of stopwatches. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 138–152. Springer, Heidelberg (2000) CrossRefGoogle Scholar
  6. 6.
    Berard, B., Haddad, S., Sassolas, M.: Real time properties for interrupt timed automata. In: TIME 2010, pp. 69–76. IEEE (2010)Google Scholar
  7. 7.
    Krishna, S.N., Manasa L., Trivedi, A.: What’s decidable about recursive hybrid automata? In: HSCC 2015, pp. 31–40. ACM (2015)Google Scholar
  8. 8.
    Abdulla, P.A., Atig, M.F., Stenman, J.: Dense-timed pushdown automata. In: LICS 2012, pp. 35–44. IEEE (2012)Google Scholar
  9. 9.
    Cai, X., Ogawa, M.: Well-structured pushdown system: case of dense timed pushdown automata. In: Codish, M., Sumii, E. (eds.) FLOPS 2014. LNCS, vol. 8475, pp. 336–352. Springer, Heidelberg (2014) CrossRefGoogle Scholar
  10. 10.
    Cai, X., Ogawa, M.: Well-structured pushdown systems. In: D’Argenio, P.R., Melgratti, H. (eds.) CONCUR 2013 – Concurrency Theory. LNCS, vol. 8052, pp. 121–136. Springer, Heidelberg (2013) CrossRefGoogle Scholar
  11. 11.
    Leroux, J., Praveen, M., Sutre, G.: Hyper-ackermannian bounds for pushdown vector addition systems. In: CSL-LICS 2014, pp. 63:1–63:10. IEEE (2014)Google Scholar
  12. 12.
    Henzinger, T.A., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic Model Checking for Real-Time Systems. Information and Computation 111, 193–244 (1994)CrossRefMathSciNetMATHGoogle Scholar
  13. 13.
    Ouaknine, J., Worrell, J.: On the language inclusion problem for timed automata: closing a decidability gap. In: LICS 2004, pp. 54–63. IEEE (2004)Google Scholar
  14. 14.
    Abdulla, P.A., Jonsson, B.: Verifying networks of timed processes (extended abstract). In: Steffen, B. (ed.) TACAS 1998. LNCS, vol. 1384, pp. 298–312. Springer, Heidelberg (1998) CrossRefGoogle Scholar
  15. 15.
    Abdulla, P., Jonsson, B.: Model Checking of Systems with Many Identical Time Processes. Theoretical Computer Science 290, 241–264 (2003)CrossRefMathSciNetMATHGoogle Scholar
  16. 16.
    Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall (1967)Google Scholar
  17. 17.
    Henzinger, T., Kopke, P., Puri, A., Varaiya, P.: What’s Decidable about Hybrid Automata? Journal of Computer and System Sciences 57, 94–124 (1998)CrossRefMathSciNetMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.BASICS, School of SoftwareShanghai Jiao Tong UniversityShanghaiChina
  2. 2.Japan Advanced Institute of Science and TechnologyNomiJapan
  3. 3.Graduate School of Information ScienceNagoya UniversityNagoyaJapan

Personalised recommendations