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

類似資料