Trace Refinement in Labelled Markov Decision Processes

@inproceedings{Fijalkow2016TraceRI,
  title={Trace Refinement in Labelled Markov Decision Processes},
  author={Nathana{\"e}l Fijalkow and S. Kiefer and M. Shirmohammadi},
  booktitle={FoSSaCS},
  year={2016}
}
Given two labelled Markov decision processes (MDPs), the trace-refinement problem asks whether for all strategies of the first MDP there exists a strategy of the second MDP such that the induced labelled Markov chains are trace-equivalent. We show that this problem is decidable in polynomial time if the second MDP is a Markov chain. The algorithm is based on new results on a particular notion of bisimulation between distributions over the states. However, we show that the general trace… Expand
L O ] 2 8 N ov 2 01 8 TRACE REFINEMENT IN LABELLED MARKOV DECISION PROCESSES
Comparing Labelled Markov Decision Processes
The Complexity of Synchronizing Markov Decision Processes
Linear Distances between Markov Chains
On Rationality of Nonnegative Matrix Factorization

References

SHOWING 1-10 OF 38 REFERENCES
Equivalence of Labeled Markov Chains
Probabilistic Bisimulation: Naturally on Distributions
On Path Equivalence of Nondeterministic Finite Automata
  • W. Tzeng
  • Mathematics, Computer Science
  • Inf. Process. Lett.
  • 1996
On the complexity of space bounded interactive proofs
  • A. Condon, R. Lipton
  • Mathematics, Computer Science
  • 30th Annual Symposium on Foundations of Computer Science
  • 1989
Reachability in two-clock timed automata is PSPACE-complete
...
1
2
3
4
...