Labelled Markov processes are continuous-state fully probabilistic labelled transition systems. They can be seen as co-algebras of a suitable monad on the category of measurable space. The theory as developed so far included a treatment of bisimulation, logical characterization of bisimulation, weak bisimulation, metrics, universal domains for LMPs and approximations. Much of the theory involved delicate properties of analytic spaces. Recently a new kind of averaging procedure was used to construct approximations. Remarkably, this version of the theory uses a dual view of LMPs and greatly simplifies the theory eliminating the need to consider aanlytic spaces. In this talk I will survey some of the ideas that led to this work. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Chaput, P., Danos, V., Panangaden, P., & Plotkin, G. (2009). Approximating labelled markov processes again! In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5728 LNCS, pp. 145–156). https://doi.org/10.1007/978-3-642-03741-2_11
Mendeley helps you to discover research relevant for your work.