Bisimulation through probabilistic testing
Information and Computation
Communication and Concurrency
Hybrid Systems with Finite Bisimulations
Hybrid Systems V
Automatica (Journal of IFAC)
Proving Approximate Implementations for Probabilistic I/O Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Approximate abstraction of stochastic hybrid automata
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Bisimulation for general stochastic hybrid systems
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
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).