タイトル(掲載誌)Research report (School of Information Science, Japan Advanced Institute of Science and Technology)
一般注記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.
リサーチレポート(北陸先端科学技術大学院大学情報科学研究科)
identifier:https://dspace.jaist.ac.jp/dspace/handle/10119/11354
一次資料へのリンクURLhttps://dspace.jaist.ac.jp/dspace/bitstream/10119/11354/1/IS-RR-2013-004.pdf
連携機関・データベース国立情報学研究所 : 学術機関リポジトリデータベース(IRDB)(機関リポジトリ)
提供元機関・データベース北陸先端科学技術大学院大学 : JAIST学術研究成果リポジトリ