Labelled Markov processes: stronger and faster approximations

MaRDI QIDQ2844076zbMATH OpenFDO

Authors Vincent Danos

Publication date 27 August 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066104051369

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Continuous-time Markov processes on discrete state spaces (60J27)

Recommendations

• Approximating labelled Markov processes
• scientific article; zbMATH DE number 2086650
• Approximating labelled Markov processes again!
• Conditional expectation and the approximation of labelled Markov processes.
• Approximating Markov processes by averaging

Cited in

(13)

• Hyperfinite Approximations to Labeled Markov Transition Systems
• Approximating Markov processes through filtration
• Approximate analyzing of labeled transition systems
• Approximating Markov Processes by Averaging
• Metrics for labelled Markov processes
• Approximating labelled Markov processes
• Domain theory, testing and simulation for labelled Markov processes
• Concurrency, σ-Algebras, and Probabilistic Fairness
• Approximating labelled Markov processes again!
• Probabilistic model checking of labelled Markov processes via finite approximate bisimulations
• Conditional expectation and the approximation of labelled Markov processes.
• Some properties of stochastic labeling procedures
• Finite Approximation of LMPs for Exact Verification of Reachability Properties

This page was built for publication: Labelled Markov processes: stronger and faster approximations

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