Duality for Labelled Markov Processes

Duality for Labelled Markov Processes

Cached

Download Links

[www-2.cs.cmu.edu]
[web.comlab.ox.ac.uk]

Other Repositories/Bibliography

DBLP

by Michael Mislove , Joël Ouaknine , Dusko Pavlovic , James Worrell

Citations:

7 - 1 self

Versions

Version History

Metadata Version 3

User correction supplied by mph

Datum	Value	Source
TITLE	Duality for Labelled Markov Processes	user correction - Legacy Corrections
AUTHOR NAME	Michael Mislove	user correction
AUTHOR AFFIL	Tulane University, Department of Mathematics	user correction
AUTHOR ADDR	New Orleans, USA	user correction
AUTHOR NAME	Joël Ouaknine	user correction
AUTHOR AFFIL	Computer Science Department, Carnegie Mellon University, USA	user correction
AUTHOR NAME	Dusko Pavlovic	user correction
AUTHOR AFFIL	Kestrel Institute	user correction
AUTHOR ADDR	Palo Alto, USA	user correction
AUTHOR NAME	James Worrell	user correction
AUTHOR AFFIL	Tulane University, Department of Mathematics	user correction
AUTHOR ADDR	New Orleans, USA	user correction
ABSTRACT	Labelled Markov processes (LMPs) are automata whose transitions are given by probability distributions. In this paper we present a `universal' LMP as the spectrum of a commutative C # -algebra consisting of formal linear combinations of labelled trees. We characterize the state space of the universal LMP as the set of homomorphims from an ordered commutative monoid of labelled trees into the multiplicative unit interval. This yields a simple semantics for LMPs which is fully abstract with respect to probabilistic bisimilarity. We also consider LMPs with entry points and exit points in the setting of iteration theories. We define an iteration theory of LMPs by specifying its categorical dual: a certain category of C*-algebras. We find that the basic operations for composing LMPs have simple definitions in the dual category.	user correction
CITATIONS	22 found	ParsCit 1.0