Symbolic Reachability Analysis of Probabilistic Linear Hybrid Automata(<Special Section>Concurrent/Hybrid Systems : Theory and Applications)

スポンサーリンク

概要

• 論文の詳細を見る

• We can model embedded systems as hybrid systems. Moreover, they are distributed and real-time systems. Therefore, it is important to specify and verify randomness and soft real-time properties. For the purpose of system verification, we formally define probabilistic linear hybrid automaton and its symbolic reachability analysis method. It can describe uncertainties and soft real-time characteristics. Copyright © 2005 The Institute of Electronics, Information and Communication Engineers

• 社団法人電子情報通信学会の論文
• 2005-11-01

著者

• Yamane Satoshi

  Graduate School Of Natural Science & Technology Kanazawa University

• MUTSUDA Yosuke

  Graduate School of Natural Science & Technology, Kanazawa University

• KATO Takaaki

  Graduate School of Natural Science & Technology, Kanazawa University

• Kato Takaaki

  Graduate School Of Natural Science & Technology Kanazawa University

• Mutsuda Yosuke

  Graduate School Of Natural Science & Technology Kanazawa University

• Yamane Satoshi

  Graduate School And Science Of Engineering Saitama University

関連論文

• Symbolic Reachability Analysis of Probabilistic Linear Hybrid Automata(Concurrent/Hybrid Systems : Theory and Applications)
• Estimation of Welding Voltage Using Neural Network in GMA Welding

スポンサーリンク