Stochastic transition systems for continuous state spaces and non-determinism

30Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We study the interaction between non-deterministic and probabilistic behaviour in systems with continuous state spaces, arbitrary probability distributions and uncountable branching. Models of such systems have been proposed previously. Here, we introduce a model that extends probabilistic automata to the continuous setting. We identify the class of schedulers that ensures measurability properties on executions, and show that such measurability properties are preserved by parallel composition. Finally, we demonstrate how these results allow us to define an alternative notion of weak bisimulation in our model. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Cattani, S., Segala, R., Kwiatkowska, M., & Norman, G. (2005). Stochastic transition systems for continuous state spaces and non-determinism. In Lecture Notes in Computer Science (Vol. 3441, pp. 125–139). Springer Verlag. https://doi.org/10.1007/978-3-540-31982-5_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free