Comparing labelled Markov decision processes

DOI10.4230/LIPICS.FSTTCS.2020.49MaRDI QIDQ6839853zbMATH OpenFDO

Authors Stefan Kiefer, Qiyi Tang

Publication date 23 March 2026

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2020.49

zbMATH Keywords

Markov chainsMarkov decision processesbehavioural metrics

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 1361128 (Why is no real title available?)
• scientific article; zbMATH DE number 765034 (Why is no real title available?)
• scientific article; zbMATH DE number 3371972 (Why is no real title available?)
• A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
• Approximate verification and enumeration problems
• Bisimulation through probabilistic testing
• Computing a nonnegative matrix factorization -- provably
• Consistency for parametric interval Markov chains
• Deciding probabilistic bisimilarity distance one for labelled Markov chains
• Deciding probabilistic bisimilarity distance one for probabilistic automata
• Decision Problems for Interval Markov Chains
• EQUIVALENCE OF LABELED MARKOV CHAINS
• Fixed points, Nash equilibria, and the existential theory of the reals
• LTL model checking of interval Markov chains
• Metrics for labelled Markov processes
• Model checking of open interval Markov chains
• Model-Checking ω-Regular Properties of Interval Markov Chains
• Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
• On the Complexity of Reachability in Parametric Markov Decision Processes
• On the complexity of computing probabilistic bisimilarity
• On the complexity of nonnegative matrix factorization
• On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
• On the definition of a family of automata
• On the total variation distance of labelled Markov chains
• Optimal state-space lumping in Markov chains
• Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties
• Simple O(m n) time Markov chain lumping
• Tools and Algorithms for the Construction and Analysis of Systems
• Trace refinement in labelled Markov decision processes

Cited in

(1)

• Minimising the probabilistic bisimilarity distance

This page was built for publication: Comparing labelled Markov decision processes

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