Nested timed automata

Authors:
Guoqiang Li;Xiaojuan Cai;Mizuhito Ogawa;Shoji Yuen
Affiliations:
School of Software, Shanghai Jiao Tong University, China;School of Software, Shanghai Jiao Tong University, China;Japan Advanced Institute of Science and Technology, Japan;Graduate School of Information Science, Nagoya University, Japan
Venue:
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
Year:
2013

Citing 13
Cited 0

A theory of timed automata

Theoretical Computer Science
Symbolic model checking for real-time systems

Information and Computation
On the Automatic Verification of Systems with Continuous Variables and Unbounded Discrete Data Structures

Hybrid Systems II
Pushdown timed automata: a binary reachability characterization and safety verification

Theoretical Computer Science
Deadline Analysis of Interrupt-Driven Software

IEEE Transactions on Software Engineering
Updatable timed automata

Theoretical Computer Science
Analysis of recursive state machines

ACM Transactions on Programming Languages and Systems (TOPLAS)
Task automata: Schedulability, decidability and undecidability

Information and Computation
Environmental Simulation of Real-Time Systems with Nested Interrupts

TASE '09 Proceedings of the 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering
Analysis of Timed Recursive State Machines

TIME '10 Proceedings of the 2010 17th International Symposium on Temporal Representation and Reasoning
Recursive timed automata

ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
The minimal cost reachability problem in priced timed pushdown systems

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Dense-Timed Pushdown Automata

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.