Algorithmic bisimulation for Communicating Piecewise Deterministic Markov Processes
Stefan Strubbe, Arjan J. van der Schaft · 2006
In this paper we present an algorithm for finding a bisimulation relation for stochastic hybrid systems from the class of CPDPs (Communicating Piecewise Deterministic Markov Processes). We prove that the fixed point of the algorithm forms a bisimulation on the state space of the CPDP. We give sufficient conditions on the continuous dynamics and the transition structure of a CPDP, for the computation of the algorithm to be decidable.