Symbolic Reachability Analysis of Probabilistic Linear Hybrid Automata
Yosuke Mutsuda · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 2005
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.