Towards a classification of behavioural equivalences in continuous-time Markov processes
From MaRDI portal
Publication:2133467
DOI10.1016/j.entcs.2020.09.004OpenAlexW3093622937WikidataQ113317307 ScholiaQ113317307MaRDI QIDQ2133467
Prakash Panangaden, Florence Clerc, Linan Chen
Publication date: 29 April 2022
Full work available at URL: https://doi.org/10.1016/j.entcs.2020.09.004
Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (1)
Cites Work
- A calculus of communicating systems
- Bisimulation through probabilistic testing
- Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes.
- Bisimulation for Feller-Dynkin processes
- Expressiveness of probabilistic modal logics: a gradual approach
- Bisimulation and cocongruence for probabilistic systems
- Bisimulation for labelled Markov processes
- Stochastic-Process Limits
- A Noether theorem for Markov processes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Towards a classification of behavioural equivalences in continuous-time Markov processes