Nested Timed Automata

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.

[1]  Thomas A. Henzinger,et al.  Symbolic Model Checking for Real-Time Systems , 1994, Inf. Comput..

[2]  Ahmed Bouajjani,et al.  On the Automatic Verification of Systems with Continuous Variables and Unbounded Discrete Data Structures , 1994, Hybrid Systems.

[3]  Guoqiang Li,et al.  Environmental Simulation of Real-Time Systems with Nested Interrupts , 2009, 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering.

[4]  Mizuhito Ogawa,et al.  Well-Structured Pushdown Systems, Part 2: On Reachability of Dense Timed Pushdown Automata , 2013 .

[5]  Parosh Aziz Abdulla,et al.  The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems , 2012, LATA.

[6]  Parosh Aziz Abdulla,et al.  Dense-Timed Pushdown Automata , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[7]  Jens Palsberg,et al.  Deadline analysis of interrupt-driven software , 2003, IEEE Transactions on Software Engineering.

[8]  Patricia Bouyer,et al.  Updatable timed automata , 2004, Theor. Comput. Sci..

[9]  Ashutosh Trivedi,et al.  Recursive Timed Automata , 2010, ATVA.

[10]  Adriano Peron,et al.  Analysis of Timed Recursive State Machines , 2010, 2010 17th International Symposium on Temporal Representation and Reasoning.

[11]  Wang Yi,et al.  Task automata: Schedulability, decidability and undecidability , 2007, Inf. Comput..

[12]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[13]  Wang Yi,et al.  Timed Automata: Semantics, Algorithms and Tools , 2003, Lectures on Concurrency and Petri Nets.

[14]  Zhe Dang,et al.  Pushdown timed automata: a binary reachability characterization and safety verification , 2001, Theor. Comput. Sci..

[15]  Guoqiang Li,et al.  Modeling and analysis of real -time systems with mutex components , 2010, 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW).

[16]  Alexandre David,et al.  From HUPPAAL to UPPAAL - A Translation from Hierarchical Timed Automata to Flat Timed Automata , 2001 .

[17]  Rajeev Alur,et al.  Analysis of recursive state machines , 2001, TOPL.