Approximating Labelled Markov Processes Again!

Philippe Chaput, Vincent Danos, Prakash Panangaden, Gordon Plotkin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.
Original languageEnglish
Title of host publicationAlgebra and Coalgebra in Computer Science
Subtitle of host publicationThird International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009. Proceedings
EditorsAlexander Kurz, Marina Lenisa, Andrzej Tarlecki
PublisherSpringer Berlin Heidelberg
Pages145-156
Number of pages12
Volume5728
ISBN (Electronic)978-3-642-03741-2
ISBN (Print)978-3-642-03740-5
DOIs
Publication statusPublished - 2009

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin Heidelberg
Volume5728

Fingerprint Dive into the research topics of 'Approximating Labelled Markov Processes Again!'. Together they form a unique fingerprint.

Cite this