Conditional expectation and the approximation of labelled Markov processes.

DOI10.1007/B11938MaRDI QIDQ5900584zbMATH OpenOpenAlexFDO

Authors Vincent Danos, Josée Desharnais, Prakash Panangaden

Publication date 30 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b11938

Mathematics Subject Classification ID

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

Recommendations

• Approximating labelled Markov processes again!
• Approximating Markov processes by averaging
• Labelled Markov processes: stronger and faster approximations
• Approximating labelled Markov processes
• Labelled Markov processes.

Cited in

(8)

• When are stochastic transition systems tameable?
• Bisimulation for Feller-Dynkin processes
• Borel kernels and their approximation, categorically
• On finite-state approximants for probabilistic computation tree logic
• Labelled Markov processes: stronger and faster approximations
• Approximating labelled Markov processes again!
• Approximating Markov processes through filtration
• Approximating Markov processes by averaging

This page was built for publication: Conditional expectation and the approximation of labelled Markov processes.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5900584)