Specification and verification techniques of embedded systems using probabilistic linear hybrid automata

Authors:
Yosuke Mutsuda;Takaaki Kato;Satoshi Yamane
Affiliations:
Graduate School of Natural Science & Technology, Kanazawa University, Kanazawa city, Japan;Graduate School of Natural Science & Technology, Kanazawa University, Kanazawa city, Japan;Graduate School of Natural Science & Technology, Kanazawa University, Kanazawa city, Japan
Venue:
ICESS'05 Proceedings of the Second international conference on Embedded Software and Systems
Year:
2005

Citing 10
Cited 0

Temporal and modal logic

Handbook of theoretical computer science (vol. B)
Symbolic model checking for real-time systems

Information and Computation
The algorithmic analysis of hybrid systems

Theoretical Computer Science - Special issue on hybrid systems
The complexity of probabilistic verification

Journal of the ACM (JACM)
Model checking

Model checking
Termination of Probabilistic Concurrent Program

ACM Transactions on Programming Languages and Systems (TOPLAS)
Automatic verification of real-time systems with discrete probability distributions

Theoretical Computer Science
Automatic Symbolic Verification of Embedded Systems

IEEE Transactions on Software Engineering
Decidable Model Checking of Probabilistic Hybrid Automata

FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Using HyTech to Synthesize Control Parameters for a Steam Boiler

Formal Methods for Industrial Applications, Specifying and Programming the Steam Boiler Control (the book grow out of a Dagstuhl Seminar, June 1995).

Quantified Score

Hi-index	0.00

Visualization

Abstract

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. Our proposal method is the first attempt to symbolically verify probabilistic linear hybrid automata.