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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Abramsky, S.: A Domain Equation for Bisimulation. Information and Computation 92, 161–218 (1991)
Abramsky, S., Vickers, S.: Quantales, observational logic and process semantics. Mathematical Structures in Computer Science 3, 161–227 (1993)
Abramsky, S., Blute, R., Panangaden, P.: Nuclear and Trace Ideals in Tensor-∗- categories. Journal of Pure and Applied Algebra 143, 3–47 (1999)
Aceto, L., Ésik, Z., Ingólfsdóttir, A.: Equational Axioms for Probabilistic Bisimilarity. In: Kirchner, H., Ringeissen, C. (eds.) AMAST 2002. LNCS, vol. 2422, pp. 239–253. Springer, Heidelberg (2002)
Bloom, S., Esik, Z.: Iteration Theories. EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (1993)
Bloom, S., Esik, Z.: The Equational Logic of Fixed Points. Theoretical Computer Science 179, 1–60
van Breugel, F., Worrell, J.B.: An algorithm for quantitative verification of probabilistic transition systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, p. 336. Springer, Heidelberg (2001)
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)
Desharnais, J., Edalat, A., Panangaden, P.: Bisimulation for Labelled Markov Processes. Information and Computation 179(2), 163–193 (2002)
Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: Metrics for labeled markov systems. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, p. 258. Springer, Heidelberg (1999)
Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: Approximating Labeled Markov Processes. Information and Computation 184(1), 160–200 (2003)
Esik, Z., Kuich, W.: Formal Tree Series. Journal of Automata Languages and Combinatorics 8(2), 145–185 (2003)
Naimark, M.A.: Normed Rings, 2nd edn., Nauka, Moscow (1968), reprint of the revised English edition, Wolters-Noordhoff, Groningen (1970)
van Glabbeek, R., Smolka, S., Steffen, B.: Reactive, generative and stratified models of probabilistic processes. Information and Computation 121(1), 59–80 (1996)
Kozen, D.: The Semantics of Probabilistic Programs. Journal of Computer and System Science 22, 328–350 (1981)
Johnstone, P.: Stone Spaces. Cambridge University Press, Cambridge (1982)
Jonsson, B., Larsen, K., Yi, W.: Probabilistic Extensions of Process Algebras. In: Bergstra, J.A., Ponse, A., Smolka, S. (eds.) Handbook of Process Algebra, pp. 685–710. Elsevier, Amsterdam (2001)
Larsen, K.G., Skou, A.: Bisimulation through Probabilistic Testing. Information and Computation 94(1), 1–28 (1991)
Mislove, M., Ouaknine, J., Worrell, J.: Axioms for Probability and Nondeterminism. In: Proc. EXPRESS 2003. ENTCS, vol. 91(3) (2003)
Parthasarathy, K.R.: Probability Measures on Metric Spaces. Academic Press, London (1967)
Di Pierro, A., Hankin, C., Wiklicky, H.: Quantitative Relations and Approximate Process Equivalences. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 508–522. Springer, Heidelberg (2003)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mislove, M., Ouaknine, J., Pavlovic, D., Worrell, J. (2004). Duality for Labelled Markov Processes. In: Walukiewicz, I. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2004. Lecture Notes in Computer Science, vol 2987. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24727-2_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-24727-2_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21298-0
Online ISBN: 978-3-540-24727-2
eBook Packages: Springer Book Archive