Trace refinement in labelled Markov decision processes
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...
Main Authors: | Fijalkow, N, Kiefer, S, Shirmohammadi, M |
---|---|
Format: | Journal article |
Published: |
European Joint Conferences on Theory and Practice of Software (ETAPS)
2015
|
Similar Items
-
Trace refinement in labelled Markov decision processes
by: Fijalkow, N, et al.
Published: (2015) -
Trace refinement in labelled Markov decision processes
by: Fijalkow, N, et al.
Published: (2020) -
Trace Refinement in Labelled Markov Decision Processes
by: Nathanaël Fijalkow, et al.
Published: (2020-06-01) -
Comparing labelled Markov decision processes
by: Kiefer, S, et al.
Published: (2020) -
Synchronizing Objectives for Markov Decision Processes
by: Mahsa Shirmohammadi, et al.
Published: (2011-02-01)