Decidable Model Checking of Probabilistic Hybrid Automata
by
Unknown Authors
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@MISC{_decidablemodel,
author = {},
title = {Decidable Model Checking of Probabilistic Hybrid Automata},
year = {}
}
author = {},
title = {Decidable Model Checking of Probabilistic Hybrid Automata},
year = {}
}
Bookmarks
OpenURL
Abstract:
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.
Citations
| 2708 | Communication and Concurrency – Milner - 1989 |
| 450 | The algorithmic analysis of hybrid systems – Alur, Courcoubetis, et al. - 1995 |
| 126 | A Theory of Timed Automata, Theoretical Computer Science 126 – Alur, Dill - 1994 |
| 96 | Model checking for a probabilistic branching time logic with fairness – Baier, Kwiatkowska - 1998 |
| 60 | Specification and refinement of probabilistic processes – Jonsson, Larsen - 1991 |
