Abstract
CPDPs (Communicating Piecewise Deterministic Markov Processes) can be used for compositional specification of systems from the class of stochastic hybrid processes formed by PDPs (Piecewise Deterministic Markov Processes). We define CPDPs and the composition of CPDPs, and prove that the class of CPDPs is closed under composition. Then we introduce a notion of bisimulation for PDPs and CPDPs and we prove that bisimilar PDPs as well as bisimilar CPDPs have equal stochastic behavior. Finally, as main result, we prove the congruence property that, for a composite CPDP, substituting components by different but bisimilar components results in a CPDP that is bisimilar to the original composite CPDP (and therefore has equal stochastic behavior).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Davis, M.H.A.: Piecewise Deterministic Markov Processes: a general class of non-diffusion stochastic models. Journal Royal Statistical Soc (B) 46, 353–388 (1984)
Davis, M.H.A.: Markov Models and Optimization. Chapman & Hall, London (1993)
Strubbe, S.N., Julius, A.A., van der Schaft, A.J.: Communicating Piecewise Deterministic Markov Processes. In: Preprints Conference on Analysis and Design of Hybrid Systems ADHS 2003, pp. 349–354 (2003)
Strubbe, S.N., van der Schaft, A.J.: Stochastic equivalence of CPDP-automata and Piecewise Deterministic Markov Processes. Accepted for the IFAC world congress 2005 (2005)
Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Information and Computation 94, 1–28 (1991)
D’Argenio, P.R.: Algebras and Automata for Timed and Stochastic Systems. PhD thesis, University of Twente (1997)
Hermanns, H.: Interactive Markov Chains. In: Hermanns, H. (ed.) Interactive Markov Chains. LNCS, vol. 2428. Springer, Heidelberg (2002)
Pappas, G.: Bisimilar linear systems. Automatica 39, 2035–2047 (2003)
van der Schaft, A.: Bisimulation of dynamical systems. In: Alur, R., Pappas, G.J. (eds.) HSCC 2004. LNCS, vol. 2993, pp. 555–569. Springer, Heidelberg (2004)
Lafferriere, G., Pappas, G., Sastry, S.: Hybrid systems with finite bisimulations. In: Antsaklis, P.J., Kohn, W., Lemmon, M.D., Nerode, A., Sastry, S.S. (eds.) HS 1997. LNCS, vol. 1567, pp. 186–203. Springer, Heidelberg (1999)
van der Schaft, A.: Equivalence of hybrid dynamical systems. In: Proceedings of the 16th international symposium on Mathematical Theory of Networks and Systems (2004)
Strubbe, S.: Public Deliverable 17 of the Hybridge project. Technical report, Twente University (2004)
Strubbe, S.: PD16 of Hybridge, Semantics and interaction-structures for the CPDP-model. Technical report, Twente University (2004)
Parthasarathy, K.: Probability Measures on Metric Spaces. Academic Press, London (1967)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Strubbe, S., van der Schaft, A. (2005). Bisimulation for Communicating Piecewise Deterministic Markov Processes (CPDPs). In: Morari, M., Thiele, L. (eds) Hybrid Systems: Computation and Control. HSCC 2005. Lecture Notes in Computer Science, vol 3414. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31954-2_40
Download citation
DOI: https://doi.org/10.1007/978-3-540-31954-2_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25108-8
Online ISBN: 978-3-540-31954-2
eBook Packages: Computer ScienceComputer Science (R0)