Observation equivalence as a testing equivalence
Theoretical Computer Science
A domain equation for bisimulation
Information and Computation
Bisimulation through probabilistic testing
Information and Computation
The Pattern-of-Calls Expansion Is the Canonical Fixpoint for Recursive Definitions
Journal of the ACM (JACM)
A complete axiom system for finite-state probabilistic processes
Proof, language, and interaction
Equational Axioms for Probabilistic Bisimilarity
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Metrics for Labeled Markov Systems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Retracting Some Paths in Process Algebra
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
Approximating labelled Markov processes
Information and Computation
Bisimulation and cocongruence for probabilistic systems
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Domain theory, testing and simulation for labelled Markov processes
Theoretical Computer Science - Foundations of software science and computation structures
Reasoning about probabilistic security using task-PIOAs
ARSPA-WITS'10 Proceedings of the 2010 joint conference on Automated reasoning for security protocol analysis and issues in the theory of security
| Hi-index | 0.00 |
Labelled Markov processes (LMPs) are labelled transition systems in which each transition has an associated probability. In this paper we present a universal LMP as the spectrum of a commutative C*-algebra consisting of formal linear combinations of labelled trees. This yields a simple trace-tree semantics for LMPs that is fully abstract with respect to probabilistic bisimilarity. We also consider LMPs with distinguished entry and exit points as stateful stochastic relations. This allows us to define a category GSRel of generalized stochastic relations, which has measurable spaces as objects and LMPs as morphisms. Our main result in this context is to provide a predicate-transformer duality for GSRel that generalises Kozen's duality for the category SRel of stochastic relations.