Behavioural equivalences for continuous-time Markov processes
From MaRDI portal
Publication:6149932
DOI10.1017/s0960129523000099OpenAlexW4361272622MaRDI QIDQ6149932
Linan Chen, Florence Clerc, Prakash Panangaden
Publication date: 5 March 2024
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129523000099
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unprovability of the logical characterization of bisimulation
- A calculus of communicating systems
- Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes.
- Bisimulation for Feller-Dynkin processes
- Towards a classification of behavioural equivalences in continuous-time Markov processes
- Expressiveness of probabilistic modal logics: a gradual approach
- Bisimulation and cocongruence for probabilistic systems
- Bisimulation for labelled Markov processes
- Stochastic-Process Limits
- Semi-pullbacks for stochastic relations over analytic spaces
This page was built for publication: Behavioural equivalences for continuous-time Markov processes