Bisimulation for Feller-Dynkin processes

DOI10.1016/j.entcs.2019.09.004OpenAlexW2995907685WikidataQ113317359 ScholiaQ113317359MaRDI QIDQ2133163

Linan Chen, Florence Clerc, Prakash Panangaden

Publication date: 29 April 2022

Full work available at URL: https://arxiv.org/abs/1904.00976

zbMATH Keywords

diffusionstochastic processesMarkov processesbisimulationcontinuous time

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Bisimulation for Feller-Dynkin processes ⋮ Towards a classification of behavioural equivalences in continuous-time Markov processes ⋮ Behavioural equivalences for continuous-time Markov processes

Cites Work

• Metrics for labelled Markov processes
• The algorithmic analysis of hybrid systems
• A calculus of communicating systems
• Bisimulation through probabilistic testing
• A theory of timed automata
• Approximating labelled Markov processes
• Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes.
• Domain theory, testing and simulation for labelled 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
• Approximate reasoning for real-time probabilistic processes
• Approximating Markov Processes by Averaging
• CONCUR 2003 - Concurrency Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bisimulation for Feller-Dynkin processes