Abstract
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.
Original language | English |
---|---|
Title of host publication | Proceedings of the 44th IEEE Conference on Decision and Control and the 2005 European Control Conference (CDC-ECC '05) |
Publisher | IEEE |
Pages | 6109-6114 |
Number of pages | 6 |
ISBN (Print) | 0-7803-9568-9 |
DOIs | |
Publication status | Published - Dec 2005 |
Event | 44th Conference on Decision and Control, and 2005 European Control Conference, CDC-ECC 2005 - Melia Seville, Seville, Spain Duration: 12 Dec 2005 → 15 Dec 2005 Conference number: 44 |
Publication series
Name | Proceedings of the IEEE Conference on Decision and Control |
---|---|
Publisher | IEEE |
Volume | 2005 |
ISSN (Print) | 0191-2216 |
Conference
Conference | 44th Conference on Decision and Control, and 2005 European Control Conference, CDC-ECC 2005 |
---|---|
Abbreviated title | CDC-ECC |
Country/Territory | Spain |
City | Seville |
Period | 12/12/05 → 15/12/05 |
Keywords
- Communicating Piecewise Deterministic Markov Processes (CPDPs)