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...
Hlavní autoři: | Fijalkow, N, Kiefer, S, Shirmohammadi, M |
---|---|
Médium: | Journal article |
Vydáno: |
European Joint Conferences on Theory and Practice of Software (ETAPS)
2015
|
Podobné jednotky
-
Trace refinement in labelled Markov decision processes
Autor: Fijalkow, N, a další
Vydáno: (2015) -
Trace refinement in labelled Markov decision processes
Autor: Fijalkow, N, a další
Vydáno: (2020) -
Trace Refinement in Labelled Markov Decision Processes
Autor: Nathanaël Fijalkow, a další
Vydáno: (2020-06-01) -
Comparing labelled Markov decision processes
Autor: Kiefer, S, a další
Vydáno: (2020) -
Synchronizing Objectives for Markov Decision Processes
Autor: Mahsa Shirmohammadi, a další
Vydáno: (2011-02-01)