Abstract
This chapter provides a new approach for dealing with stochastic reachability. Instead of looking for new methods for computing reach set probabilities in the initial framework of stochastic hybrid processes, we propose to use the existing ones but in a changed framework. Precisely, the idea is to replace the complex stochastic processes that appear in the semantics of stochastic hybrid systems by simpler processes that are ‘probabilistically equivalent’. This means that the behaviour of the new simpler processes preserves only the probabilistic properties of interest for our analysis. The relation between a given stochastic hybrid process and its “equivalent version” is called bisimulation relation. This bisimulation relation can appear by relaxing the classical equivalence relations between stochastic processes that ask the exact equality between probabilities of trajectories at each moment of time. A process bisimilar to a given one should not be thought as a probabilistic version of it. The idea is to reduce the state space by lumping those states that behave in a similar way. Clearly, if we would be able to reduce the state space, the stochastic reachability analysis becomes more manageable. Usually, the main goal of the research in this field is to find suitable Markov chains (with a manageable state space) that are bisimilar with a given stochastic hybrid process.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
An erratum to this chapter can be found at http://dx.doi.org/10.1007/978-1-4471-2795-6_12
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Abate, A., D’Innocenzo, A., Benedetto, M.D., Sastry, S.: Markov set-chains as abstractions of stochastic hybrid systems. In: Egerstedt, M., Mishra, B. (eds.) Hybrid Systems: Computation and Control. Lecture Notes in Computer Science, vol. 4981, pp. 1–15. Springer, Berlin (2008)
Bertsekas, D.P., Shreve, S.E.: Stochastic Optimal Control: The Discrete-Time Case. Athena Scientific, Nashua (1996)
Dynkin, E.B.: Markov Processes I. Springer, Berlin (1965)
Fitzsimmons, P.J.: Markov processes with equal capacities. J. Theor. Probab. 12, 271–292 (1999)
Julius, A.A., Pappas, G.J.: Approximate abstraction of stochastic hybrid systems. IEEE Trans. Autom. Control 54(6), 1193–1203 (2009)
Julius, A.A., D’Innocenzo, A., Di Benedetto, M.D., Pappas, G.J.: Approximate equivalence and synchronization of metric transition systems. Syst. Control Lett. 58, 94–101 (2009)
Julius, A.A.: Approximate abstraction of stochastic hybrid automata. In: Hespanha, J.P., Tiwari, A. (eds.) Hybrid Systems: Computation and Control. Lecture Notes in Computer Science, vol. 3927, pp. 318–332. Springer, Berlin (2006)
Tabuada, P., Ames, A., Julius, A.A., Pappas, G.J.: Approximate reduction of dynamical systems. Syst. Control Lett. 7(57), 538–545 (2008)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag London Limited
About this chapter
Cite this chapter
Bujorianu, L.M. (2012). Stochastic Reachability Based on Probabilistic Bisimulation. In: Stochastic Reachability Analysis of Hybrid Systems. Communications and Control Engineering. Springer, London. https://doi.org/10.1007/978-1-4471-2795-6_9
Download citation
DOI: https://doi.org/10.1007/978-1-4471-2795-6_9
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-4471-2794-9
Online ISBN: 978-1-4471-2795-6
eBook Packages: EngineeringEngineering (R0)