Approximating Markov Processes by Averaging
From MaRDI portal
Publication:5902151
DOI10.1007/978-3-642-02930-1_11zbMath1248.68322MaRDI 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
60J25: Continuous-time Markov processes on general state spaces
68Q60: Specification and verification (program logics, model checking, etc.)
68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
Related Items
Anatomy of a Domain of Continuous Random Variables II, Towards a Categorical Account of Conditional Probability, Probabilistic Model Checking of Labelled Markov Processes via Finite Approximate Bisimulations, Bisimulation for Markov Decision Processes through Families of Functional Expressions, A categorical characterization of relative entropy on standard Borel spaces, Approximating bisimilarity for Markov processes, Measurable stochastics for Brane calculus, Approximating Markov processes through filtration, A logical duality for underspecified probabilistic systems, A categorical characterization of relative entropy on standard Borel spaces
