Approximating Labelled Markov Processes Again!

Abstract. 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.

• Type: Conference
• Year: 2009
• Where: CALCO
• Authors: Philippe Chaput, Vincent Danos, Prakash Panangaden, Gordon D. Plotkin
• Keywords: CALCO 2009, Mathematics, Probabilistic Labelled Transition, Theory, Weak Bisimulation