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...
المؤلفون الرئيسيون: | Fijalkow, N, Kiefer, S, Shirmohammadi, M |
---|---|
التنسيق: | Journal article |
منشور في: |
European Joint Conferences on Theory and Practice of Software (ETAPS)
2015
|
مواد مشابهة
-
Trace refinement in labelled Markov decision processes
حسب: Fijalkow, N, وآخرون
منشور في: (2015) -
Trace refinement in labelled Markov decision processes
حسب: Fijalkow, N, وآخرون
منشور في: (2020) -
Trace Refinement in Labelled Markov Decision Processes
حسب: Nathanaël Fijalkow, وآخرون
منشور في: (2020-06-01) -
Comparing labelled Markov decision processes
حسب: Kiefer, S, وآخرون
منشور في: (2020) -
Synchronizing Objectives for Markov Decision Processes
حسب: Mahsa Shirmohammadi, وآخرون
منشور في: (2011-02-01)