Bisimulation for communicating piecewise deterministic Markov processes (CPDPs)
From MaRDI portal
Recommendations
- Communicating piecewise deterministic Markov processes
- Piecewise deterministic Markov processes represented by dynamically coloured Petri nets
- Bisimulation for general stochastic hybrid systems
- Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes
- Bisimulation for labelled Markov processes
Cited in
(6)- Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey
- Proving approximate implementations for probabilistic I/O automata
- Communicating piecewise deterministic Markov processes
- Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains
- Verification of general Markov decision processes by approximate similarity relations and policy refinement
- scientific article; zbMATH DE number 7333244 (Why is no real title available?)
This page was built for publication: Bisimulation for communicating piecewise deterministic Markov processes (CPDPs)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5703957)