A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Algorithmic bisimulation for Communicating Piecewise Deterministic Markov Processes
Proceedings of the 44th IEEE Conference on Decision and Control
Preserved Fulltext
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.
doi:10.1109/cdc.2005.1583139
fatcat:wdt6scvsxfgjpl5dcayzo5ubaq