This paper proposes a new timed model named nested timed automata (NeTAs). A NeTA is a pushdown system whose stack symbols are timed automata (TAs). It either behaves as the top TA in the stack, or switches from one TA to another by pushing, popping, or changing the top TA of the stack. Different from existing component-based context-switch models such as recursive timed automata and timed recursive state machines, when time passage happens, all clocks of TAs in the stack elapse uniformly. We show that the safety property of NeTAs is decidable by encoding NeTAs to the dense timed pushdown automata. NeTAs provide a natural way to analyze the recursive behaviors of component-based timed systems with structure retained. We illustrate this advantage by the deadline analysis of nested interrupts. © 2013 Springer-Verlag.
CITATION STYLE
Li, G., Cai, X., Ogawa, M., & Yuen, S. (2013). Nested timed automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8053 LNCS, pp. 168–182). https://doi.org/10.1007/978-3-642-40229-6_12
Mendeley helps you to discover research relevant for your work.