DMCA
Decidable Model Checking of Probabilistic Hybrid Automata (2000)
| Citations: | 17 - 4 self |
BibTeX
@MISC{Sproston00decidablemodel,
author = {Jeremy Sproston},
title = {Decidable Model Checking of Probabilistic Hybrid Automata},
year = {2000}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Hybrid automata offer a framework for the description of systems with both discrete and continuous components, such as digital technology embedded in an analogue environment. Traditional uses of hybrid automata express choice of transitions purely in terms of nondeterminism, abstracting potentially significant information concerning the relative likelihood of certain behaviours. To model such probabilistic information, we present a variant of hybrid automata augmented with discrete probability distributions. We concentrate on restricted subclasses of the model in order to obtain decidable model checking algorithms for properties expressed in probabilistic temporal logics.
Keyphrases
probabilistic hybrid automaton decidable model checking decidable model analogue environment restricted subclass probabilistic information hybrid automaton offer relative likelihood certain behaviour traditional us significant information continuous component digital technology hybrid automaton hybrid automaton express choice probabilistic temporal logic discrete probability distribution
