JAIST Repository >
b. 情報科学研究科・情報科学系 >
b30. リサーチレポート >
Research Report - School of Information Science : ISSN 0918-7553 >
IS-RR-2013 >

このアイテムの引用には次の識別子を使用してください: http://hdl.handle.net/10119/11354

タイトル: Nested Timed Automata
著者: Li, Guoqiang
Cai, Xiaojuan
Ogawa, Mizuhito
Yuen, Shoji
発行日: 2013-06-11
出版者: 北陸先端科学技術大学院大学情報科学研究科
誌名: Research report (School of Information Science, Japan Advanced Institute of Science and Technology)
巻: IS-RR-2013-004
開始ページ: 1
終了ページ: 20
抄録: 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
資料タイプ: publisher


ファイル 記述 サイズ形式
IS-RR-2013-004.pdf240KbAdobe PDF見る/開く



お問い合わせ先 : 北陸先端科学技術大学院大学 研究推進課図書館情報係