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...

全面介紹

書目詳細資料
Main Authors: Fijalkow, N, Kiefer, S, Shirmohammadi, M
格式: Journal article
出版: European Joint Conferences on Theory and Practice of Software (ETAPS) 2015

相似書籍