Duality for Labelled Markov Processes
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.
KeywordsCommutative Ring Probabilistic Choice Exit Point Label Transition System Ring Homomorphism
- 6.Bloom, S., Esik, Z.: The Equational Logic of Fixed Points. Theoretical Computer Science 179, 1–60Google Scholar
- 8.van Breugel, F., Mislove, M., Ouaknine, J., Worrell, J.: Domains, Testing and Similarity for Labelled Markov Processes. To appear in Proceedings of FOSSACS 2003, Theoret. Comp. Sci. (2003)Google Scholar
- 13.Naimark, M.A.: Normed Rings, 2nd edn., Nauka, Moscow (1968), reprint of the revised English edition, Wolters-Noordhoff, Groningen (1970)Google Scholar
- 19.Mislove, M., Ouaknine, J., Worrell, J.: Axioms for Probability and Nondeterminism. In: Proc. EXPRESS 2003. ENTCS, vol. 91(3) (2003)Google Scholar
- 22.Stark, E.W., Smolka, S.A.: A complete axiom system for finite-state probabilistic processes. In: Proof, Language, and Interaction: Essays in Honour of Robin Milner, MIT Press, Cambridge (2000)Google Scholar