BibTeX
@MISC{Sproston_analyzingsubclasses,
author = {Jeremy Sproston},
title = {Analyzing Subclasses of Probabilistic Hybrid Automata},
year = {}
}
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 classes of the model which have restricted continuous dynamics in order to obtain, via appropriate notions of simulation and bisimulation, decidable model checking algorithms for properties expressed in a probabilistic temporal logic. 1 Introduction The proliferation of digital technology embedded in real-life environments has lead to increased interest in systems which are defined in terms of interaction between discrete and continuous components. Examples of su...
Keyphrases
probabilistic hybrid automaton continuous component digital technology decidable model continuous dynamic analogue environment probabilistic information appropriate notion hybrid automaton offer relative likelihood certain behaviour probabilistic temporal logic significant information hybrid automaton hybrid automaton express choice traditional us real-life environment discrete probability distribution
