Trace Refinement in Labelled Markov Decision Processes

DOI10.1007/978-3-662-49630-5_18zbMath1475.68203arXiv1510.09102OpenAlexW3046661466MaRDI QIDQ2811347

Mahsa Shirmohammadi, Nathanaël Fijalkow, Stefan Kiefer

Publication date: 10 June 2016

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

Full work available at URL: https://arxiv.org/abs/1510.09102

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

The complexity of synchronizing Markov decision processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties
• Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
• On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
• On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
• On path equivalence of nondeterministic finite automata
• Undecidable problems for probabilistic automata of fixed dimension
• Reachability in two-clock timed automata is PSPACE-complete
• Approximate Verification and Enumeration Problems
• Probabilistic Bisimulation: Naturally on Distributions
• On the definition of a family of automata
• EQUIVALENCE OF LABELED MARKOV CHAINS
• On the Complexity of Nonnegative Matrix Factorization
• A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
• Stability and Complexity of Minimising Probabilistic Automata
• Computing a nonnegative matrix factorization -- provably

This page was built for publication: Trace Refinement in Labelled Markov Decision Processes