Bisimulation for communicating piecewise deterministic Markov processes (CPDP's)


Strubbe, Stefan and Schaft, Arjan van der (2005) Bisimulation for communicating piecewise deterministic Markov processes (CPDP's). In: M. Morari & L. Thiele (Eds.), Hybrid Systems: Computation and Control. Lecture Notes in Computer Science, 3414 . Springer Verlag, Berlin, pp. 623-639. ISBN 9783540251088

[img] PDF
Restricted to UT campus only

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). © Springer-Verlag Berlin Heidelberg 2005.
Item Type:Book Section
Copyright:© 2005 Springer
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:
Official URL:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page

Metis ID: 228028