Hyperfinite Approximations to Labeled Markov Transition Systems

DOI10.1007/11784180_12MaRDI QIDQ3623930zbMATHOpenAlexFDO

Authors Ernst-Erich Doberkat

Publication date 28 April 2009

Published in Algebraic Methodology and Software Technology (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Other applications of nonstandard models (economics, physics, etc.) (03H10)

Recommendations

• Approximating labelled Markov processes
• Probabilistic model checking of labelled Markov processes via finite approximate bisimulations
• Hyperaccurate bounds in discrete-state Markovian systems
• Finite approximations of Markov operators
• Stochastic approximations for finite-state Markov chains
• Labelled Markov processes: stronger and faster approximations
• Approximate analyzing of labeled transition systems
• Denumerable Constrained Markov Decision Processes and Finite Approximations

Cited in

(1)

• Hyperaccurate bounds in discrete-state Markovian systems

This page was built for publication: Hyperfinite Approximations to Labeled Markov Transition Systems

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