A Theory for the Semantics of Stochastic and Non-deterministic Continuous Systems
| Title | A Theory for the Semantics of Stochastic and Non-deterministic Continuous Systems |
| Publication Type | Book Chapter |
| Year of Publication | 2014 |
| Authors | Budde, CE, D'Argenio, PR, Sánchez Terraf, P, Wolovick, N |
| Editor | Remke, A, Stoelinga, M |
| Book Title | Stochastic Model Checking. Rigorous Dependability Analysis Using Model Checking Techniques for Stochastic Systems - International Autumn School, {ROCKS} 2012, Vahrn, Italy, October 22-26, 2012, Advanced Lectures |
| Series Title | Lecture Notes in Computer Science |
| Volume | 8453 |
| Pagination | 67–86 |
| Publisher | Springer |
| ISBN Number | 978-3-662-45488-6 |
| Abstract | The description of complex systems involving physical or biological components usually requires to model complex continuous behavior induced by variables such as time, distance, speed, temperature, alkalinity of a solution, etc. Often, such variables can be quantified probabilistically to better understand the behavior of the complex systems. For example, the arrival time of events may be considered a Poisson process or the weight of an individual may be assumed to be distributed according to a log-normal distribution. However, it is also common that the uncertainty on how these variables behave makes us prefer to leave out the choice of a particular probability and rather model it as a purely non-deterministic decision, as it is the case when a system is intended to be deployed in a variety of very different computer or network architectures. Therefore, the semantics of these systems needs to be represented by a variant of probabilistic automata that involves continuous domains on the state space and the transition relation. In this paper, we provide a survey on the theory of such kind of models. We present the theory of the so-called labeled Markov processes (LMP) and its extension with internal non-determinism (NLMP). We show that in these complex domains, the bisimulation relation can be understood in different manners. We show the relation between the different bisimulations and try to understand their expressiveness through examples. We also study variants of Hennessy-Milner logic that provides logical characterizations of some of these bisimulations. |
| DOI | 10.1007/978-3-662-45489-3_3 |
Work Package:
WP1
