### Abstract

Markov processes are a fundamental model of probabilistic transition systems and are the underlying semantics of probabilistic programs.We give an algebraic axiomatisation of Markov processes using the framework of quantitative equational logic introduced in [13]. We present the theory in a structured way using work of Hyland et al. [9] on combining monads. We take the interpolative barycentric algebras of [13] which captures the Kantorovich metric and combine it with a theory of contractive operators to give the required axiomatisation of Markov processes both for discrete and continuous state spaces. This work apart from its intrinsic interest shows how one can extend the general notion of combining effects to the quantitative setting.

Original language | English |
---|---|

Title of host publication | Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018 |

Pages | 679-688 |

Number of pages | 10 |

ISBN (Electronic) | 9781450355834, 9781450355834 |

DOIs | |

Publication status | Published - 9 Jul 2018 |

Event | 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018 - Oxford, United Kingdom Duration: 9 Jul 2018 → 12 Jul 2018 |

### Conference

Conference | 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018 |
---|---|

Country | United Kingdom |

City | Oxford |

Period | 9/07/18 → 12/07/18 |

### Keywords

- combining monads
- equational logic
- Markov processes
- quantitative reasoning

## Fingerprint Dive into the research topics of 'An algebraic theory of markov processes'. Together they form a unique fingerprint.

## Profiles

## Cite this

*Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018*(pp. 679-688) https://doi.org/10.1145/3209108.3209177