Domain theory, testing and simulation for labelled Markov processes
From MaRDI portal
Publication:1770416
DOI10.1016/j.tcs.2004.10.021zbMath1070.68108OpenAlexW2152595206MaRDI QIDQ1770416
Joël Ouaknine, James Worrell, Michael W. Mislove, Franck Van Breugel
Publication date: 6 April 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.10.021
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Bisimulation for Feller-Dynkin processes ⋮ On bisimilarity in lambda calculi with continuous probabilistic choice ⋮ On Applicative Similarity, Sequentiality, and Full Abstraction ⋮ Applicative Bisimulation and Quantum λ-Calculi ⋮ Probabilistic bisimilarity as testing equivalence ⋮ Unnamed Item ⋮ Codensity Lifting of Monads and its Dual ⋮ Bisimulation on Markov Processes over Arbitrary Measurable Spaces ⋮ Approximation in quantale-enriched categories ⋮ Final coalgebras for functors on measurable spaces ⋮ Unnamed Item ⋮ Kleisli morphisms and randomized congruences for the Giry monad ⋮ Domains and stochastic processes ⋮ On the Taylor expansion of probabilistic λ-terms ⋮ Domain semantics of possibility computations ⋮ Structural operational semantics for continuous state stochastic transition systems ⋮ Labelled Markov Processes as Generalised Stochastic Relations ⋮ Proving Approximate Implementations for Probabilistic I/O Automata
Cites Work
- Observation equivalence as a testing equivalence
- Metrics for labelled Markov processes
- On the greatest fixed point of a set functor
- Bisimulation through probabilistic testing
- Experimenting with process equivalence
- Approximating labelled Markov processes
- A behavioural pseudometric for probabilistic transition systems
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Bisimulation for labelled Markov processes
- The Category-Theoretic Solution of Recursive Domain Equations
- When Scott is weak on the top
- An Extension Result for Continuous Valuations
- Continuous Lattices and Domains
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item