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)