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
|
Ижил төстэй зүйлс
Labelled Markov Processes as Generalised Stochastic Relations
-н: Mislove, M, зэрэг
Хэвлэсэн: (2007)
-н: Mislove, M, зэрэг
Хэвлэсэн: (2007)
Ижил төстэй зүйлс
-
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)