Approximating Markov Processes by Averaging

We take a dual view of Markov processes ? advocated by Kozen ? as transformers of bounded measurable functions. We redevelop the theory of labelled Markov processes from this view point, in particular we explore approximation theory. We obtain three main results: (i) It is possible to define bisimulation on general measure spaces and show that it is an equivalence relation. The logical characterization of bisimulation can be done straightforwardly and generally. (ii) A new and flexible approach to approximation based on averaging can be given. This vastly generalizes and streamlines the idea of using conditional expectations to compute approximation. (iii) It is possible to show that there is a minimal bisimulation equivalent to a process obtained as the limit of the finite approximants.

• Type: Conference
• Year: 2009
• Where: ICALP
• Authors: Philippe Chaput, Vincent Danos, Prakash Panangaden, Gordon D. Plotkin
• Keywords: Approximation Theory, ICALP 2009, Labelled Markov Processes, Minimal Bisimulation, Theoretical Computer Science