Approximating Labelled Markov Processes Again!

Philippe Chaput; Vincent Danos; Prakash Panangaden; Gordon Plotkin

doi:10.1007/978-3-642-03741-2_11

Approximating Labelled Markov Processes Again!

Philippe Chaput, Vincent Danos, Prakash Panangaden, Gordon Plotkin

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	Algebra and Coalgebra in Computer Science
Subtitle of host publication	Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009. Proceedings
Editors	Alexander Kurz, Marina Lenisa, Andrzej Tarlecki
Publisher	Springer
Pages	145-156
Number of pages	12
Volume	5728
ISBN (Electronic)	978-3-642-03741-2
ISBN (Print)	978-3-642-03740-5
DOIs	https://doi.org/10.1007/978-3-642-03741-2_11
Publication status	Published - 2009

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer Berlin Heidelberg
Volume	5728

Access to Document

10.1007/978-3-642-03741-2_11

Chaput Danos ET AL 2009 Approximating Markov Processes by AveragingAccepted author manuscript, 180 KB

http://dx.doi.org/10.1007/978-3-642-03741-2_11

Cite this

Chaput, P., Danos, V., Panangaden, P., & Plotkin, G. (2009). Approximating Labelled Markov Processes Again! In A. Kurz, M. Lenisa, & A. Tarlecki (Eds.), Algebra and Coalgebra in Computer Science: Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009. Proceedings (Vol. 5728, pp. 145-156). (Lecture Notes in Computer Science; Vol. 5728). Springer. https://doi.org/10.1007/978-3-642-03741-2_11

Chaput, Philippe ; Danos, Vincent ; Panangaden, Prakash et al. / Approximating Labelled Markov Processes Again!. Algebra and Coalgebra in Computer Science: Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009. Proceedings. editor / Alexander Kurz ; Marina Lenisa ; Andrzej Tarlecki. Vol. 5728 Springer, 2009. pp. 145-156 (Lecture Notes in Computer Science).

@inproceedings{b16d3d895a1840ddbd44a8bcbfc23aac,

title = "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.",

author = "Philippe Chaput and Vincent Danos and Prakash Panangaden and Gordon Plotkin",

year = "2009",

doi = "10.1007/978-3-642-03741-2\_11",

language = "English",

isbn = "978-3-642-03740-5",

volume = "5728",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "145--156",

editor = "Alexander Kurz and Marina Lenisa and Andrzej Tarlecki",

booktitle = "Algebra and Coalgebra in Computer Science",

address = "United Kingdom",

}

Chaput, P, Danos, V, Panangaden, P & Plotkin, G 2009, Approximating Labelled Markov Processes Again! in A Kurz, M Lenisa & A Tarlecki (eds), Algebra and Coalgebra in Computer Science: Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009. Proceedings. vol. 5728, Lecture Notes in Computer Science, vol. 5728, Springer, pp. 145-156. https://doi.org/10.1007/978-3-642-03741-2_11

Approximating Labelled Markov Processes Again! / Chaput, Philippe; Danos, Vincent; Panangaden, Prakash et al.
Algebra and Coalgebra in Computer Science: Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009. Proceedings. ed. / Alexander Kurz; Marina Lenisa; Andrzej Tarlecki. Vol. 5728 Springer, 2009. p. 145-156 (Lecture Notes in Computer Science; Vol. 5728).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Approximating Labelled Markov Processes Again!

AU - Chaput, Philippe

AU - Danos, Vincent

AU - Panangaden, Prakash

AU - Plotkin, Gordon

PY - 2009

Y1 - 2009

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

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

U2 - 10.1007/978-3-642-03741-2_11

DO - 10.1007/978-3-642-03741-2_11

M3 - Conference contribution

SN - 978-3-642-03740-5

VL - 5728

T3 - Lecture Notes in Computer Science

SP - 145

EP - 156

BT - Algebra and Coalgebra in Computer Science

A2 - Kurz, Alexander

A2 - Lenisa, Marina

A2 - Tarlecki, Andrzej

PB - Springer

ER -

Chaput P, Danos V, Panangaden P, Plotkin G. Approximating Labelled Markov Processes Again! In Kurz A, Lenisa M, Tarlecki A, editors, Algebra and Coalgebra in Computer Science: Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009. Proceedings. Vol. 5728. Springer. 2009. p. 145-156. (Lecture Notes in Computer Science). doi: 10.1007/978-3-642-03741-2_11

Approximating Labelled Markov Processes Again!

Abstract

Publication series

Access to Document

Fingerprint

Cite this