Approximating Markov Processes by Averaging

DOI10.1007/978-3-642-02930-1_11zbMath1248.68322OpenAlexW1768623212MaRDI QIDQ5902151

Philippe Chaput, Prakash Panangaden, Vincent Danos, Gordon D. Plotkin

Publication date: 14 July 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://www.pure.ed.ac.uk/ws/files/17909857/Chaput_Danos_ET_AL_2009_Approximating_Markov_Processes_by_Averaging.pdf

Mathematics Subject Classification ID

Continuous-time Markov processes on general state spaces (60J25) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (10)

Approximating bisimilarity for Markov processes ⋮ A categorical characterization of relative entropy on standard Borel spaces ⋮ Towards a Categorical Account of Conditional Probability ⋮ Measurable stochastics for Brane calculus ⋮ Approximating Markov processes through filtration ⋮ A logical duality for underspecified probabilistic systems ⋮ Probabilistic Model Checking of Labelled Markov Processes via Finite Approximate Bisimulations ⋮ Bisimulation for Markov Decision Processes through Families of Functional Expressions ⋮ Anatomy of a Domain of Continuous Random Variables II ⋮ A categorical characterization of relative entropy on standard Borel spaces

This page was built for publication: Approximating Markov Processes by Averaging