Book Chapter10.1007/978-3-642-40229-6_12
Nested timed automata
Guoqiang Li,Xiaojuan Cai,Mizuhito Ogawa,Shoji Yuen +3 more
- 29 Aug 2013
- pp 168-182
TL;DR: In this paper, the authors propose a new timed model named nested timed automata (NeTAs), which is a pushdown system whose stack symbols are timed Automata (TAs).
read more
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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Nested timed automata
Guoqiang Li,Xiaojuan Cai,Mizuhito Ogawa,Shoji Yuen +3 more
- 29 Aug 2013
TL;DR: In this paper, the authors propose a new timed model named nested timed automata (NeTAs), which is a pushdown system whose stack symbols are timed Automata (TAs).
Timed recursive state machines
TL;DR: A temporal extension of Recursive State Machines (RSMs), called Timed RSMs (TRSMs), which consists of an indexed collection of Timed Automata, called components, which is proved to be EXPTIME-complete and PSPACE-complete, and strictly enhance the expressive power of Timing Automata and of Pushdown Timed automata, forming a proper hierarchy.
12
Nested Timed Automata with Frozen Clocks
Guoqiang Li,Mizuhito Ogawa,Shoji Yuen +2 more
- 02 Sep 2015
TL;DR: The reachability of NeTAs with frozen local clocks (NeTA-Fs) is investigated showing that (1) the reachability with a single global clock is decidable, and (2) the Reachability with multiple global clocks is undecidable.
10
Towards an Efficient Tree Automata based technique for Timed Systems
Sundararaman Akshay,Paul Gastin,Shankara Narayanan Krishna,Ilias Sarkar +3 more
- 08 Jul 2017
TL;DR: This paper builds a first prototype tool that can analyze timed systems with recursion by modeling the behaviours of the timed system as graphs, and interpreting these graphs on tree terms by showing a bound on their tree-width, and building a tree automaton that accepts exactly those tree terms that describe realizable runs of the timer.
8
Schedulability Analysis of Timed Regular Tasks by Under-Approximation on WCET
Bingbing Fang,Guoqiang Li,Daniel Sun,Hongming Cai +3 more
- 09 Nov 2016
TL;DR: This paper proposes a schedulability analysis method without the information of the WCET, by introducing a model named timed regular task automata (TRTAs), which is described by a TA, a starting point with a clock valuation, a status and a relative deadline.
7
References
A theory of timed automata
Rajeev Alur,David L. Dill +1 more
TL;DR: Alur et al. as discussed by the authors proposed timed automata to model the behavior of real-time systems over time, and showed that the universality problem and the language inclusion problem are solvable only for the deterministic automata: both problems are undecidable (II i-hard) in the non-deterministic case and PSPACE-complete in deterministic case.
7.5K
Timed Automata: Semantics, Algorithms and Tools
Johan Bengtsson,Wang Yi +1 more
- 01 Sep 2003
TL;DR: In this paper, the authors present the concrete and abstract semantics of timed automata (based on transition rules, regions and zones), decision problems, and algorithms for verification for timed systems.
The symbolic model-checking for real-time systems
TL;DR: This work has realized an effective symbolic model checker based on BDD in dense time model with the proposed method and represents state spaces by both BDD and DBM (Difference Bound Matrices).
727
Updatable timed automata
TL;DR: The thin frontier between decidable and undecidable classes of updatable timed automata is described, which turns out that any up-datable automaton belonging to some decidable subclass can be effectively transformed into an equivalent timed automaton without updates but with silent transitions.
129
Pushdown timed automata: a binary reachability characterization and safety verification
TL;DR: Since a timed automaton can be treated as a PTA without the pushdown stack, it can be shown that the binary reachability of a timedAutomaton is definable in the additive theory of reals and integers.
62
Related Papers (5)
Rajeev Alur,David L. Dill +1 more
Guoqiang Li,Mizuhito Ogawa,Shoji Yuen +2 more
- 02 Sep 2015
Sundararaman Akshay,Paul Gastin,Shankara Narayanan Krishna +2 more
- 16 Aug 2016