|
JAIST Repository >
School of Information Science >
JAIST Research Reports >
Research Report - School of Information Science ： ISSN 0918-7553 >
IS-RR-2013 >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10119/11354
|
| Title: | Nested Timed Automata |
| Authors: | Li, Guoqiang
Cai, Xiaojuan
Ogawa, Mizuhito
Yuen, Shoji |
| Issue Date: | 2013-06-11 |
| Publisher: | 北陸先端科学技術大学院大学情報科学研究科 |
| Magazine name: | Research report (School of Information Science, Japan Advanced Institute of Science and Technology) |
| Volume: | IS-RR-2013-004 |
| Start page: | 1 |
| End page: | 20 |
| Abstract: | This paper proposes a new timed model named nested timed automata (NeTAs). An 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 re-cursive 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. |
| URI: | http://hdl.handle.net/10119/11354 |
| Material Type: | publisher |
| Appears in Collections: | IS-RR-2013
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| IS-RR-2013-004.pdf | | 240Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
