Taking It to the Limit: Approximate Reasoning for Markov Processes

DOI10.1007/978-3-642-32589-2_59zbMath1365.68344OpenAlexW18942403MaRDI QIDQ2912766

Prakash Panangaden, Radu Mardare, Kim Guldstrand Larsen

Publication date: 25 September 2012

Published in: Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32589-2_59

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Markov processes (60J99) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (9)

A metrized duality theorem for Markov processes ⋮ A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces ⋮ SOS specifications for uniformly continuous operators ⋮ Comparing chemical reaction networks: a categorical and algorithmic perspective ⋮ A Hemimetric Extension of Simulation for Semi-Markov Decision Processes ⋮ Probabilistic Model Checking of Labelled Markov Processes via Finite Approximate Bisimulations ⋮ Logical characterization of branching metrics for nondeterministic probabilistic transition systems ⋮ Probabilistic NetKAT ⋮ Compositionality for quantitative specifications

This page was built for publication: Taking It to the Limit: Approximate Reasoning for Markov Processes