Observation equivalence as a testing equivalence
Theoretical Computer Science
Bisimulation through probabilistic testing
Information and Computation
Experimenting with process equivalence
Theoretical Computer Science - Selected papers of the International BCS-FACS Workshop on Semantics for Concurrency, Leicester, UK, July 1990
Probabilistic non-determinism
On the greatest fixed point of a set functor
Theoretical Computer Science
Bisimulation for probabilistic transition systems: a coalgebraic approach
Theoretical Computer Science
Communication and Concurrency
Testing Labelled Markov Processes
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
Approximating labelled Markov processes
Information and Computation
Mathematical Structures in Computer Science
Metrics for labelled Markov processes
Theoretical Computer Science - Logic, semantics and theory of programming
A behavioural pseudometric for probabilistic transition systems
Theoretical Computer Science - Automata, languages and programming
An intrinsic characterization of approximate probabilistic bisimilarity
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Final coalgebras for functors on measurable spaces
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Labelled Markov Processes as Generalised Stochastic Relations
Electronic Notes in Theoretical Computer Science (ENTCS)
Proving Approximate Implementations for Probabilistic I/O Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Domain semantics of possibility computations
Information Sciences: an International Journal
Terminal Coalgebras for Measure-Polynomial Functors
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Final coalgebras for functors on measurable spaces
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Trace-based semantics for probabilistic timed I/O automata
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Final sequences and final coalgebras for measurable spaces
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Hyperfinite approximations to labeled markov transition systems
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Continuous capacities on continuous state spaces
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Hi-index | 0.00 |
This paper presents a fundamental study of similarity and bisimilarity for labelled Markov processes (LMPs). The main results characterize similarity as a testing preorder and bisimilarity as a testing equivalence. In general, LMPs are not required to satisfy a finite-branching condition--indeed the state space may be a continuum, with the transitions given by arbitrary probability measures. Nevertheless we show that to characterize bisimilarity it suffices to use finitely-branching labelled trees as tests.Our results involve an interaction between domain theory and measure theory. One of the main technical contributions is to show that a final object in a suitable category of LMPs can be constructed by solving a domain equation D ≃V(D)Act, where V is the probabilistic powerdomain. Given an LMP whose state space is an analytic space, bisimilarity arises as the kernel of the unique map to the final LMP. We also show that the metric for approximate bisimilarity introduced by Desharnais, Gupta, Jagadeesan and Panangaden generates the Lawson topology on the domain D.