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...
Hauptverfasser: | Fijalkow, N, Kiefer, S, Shirmohammadi, M |
---|---|
Format: | Journal article |
Veröffentlicht: |
European Joint Conferences on Theory and Practice of Software (ETAPS)
2015
|
Ähnliche Einträge
Ähnliche Einträge
-
Trace refinement in labelled Markov decision processes
von: Fijalkow, N, et al.
Veröffentlicht: (2015) -
Trace refinement in labelled Markov decision processes
von: Fijalkow, N, et al.
Veröffentlicht: (2020) -
Trace Refinement in Labelled Markov Decision Processes
von: Nathanaël Fijalkow, et al.
Veröffentlicht: (2020-06-01) -
Comparing labelled Markov decision processes
von: Kiefer, S, et al.
Veröffentlicht: (2020) -
Synchronizing Objectives for Markov Decision Processes
von: Mahsa Shirmohammadi, et al.
Veröffentlicht: (2011-02-01)