首页    期刊浏览 2024年11月28日 星期四
登录注册

文章基本信息

  • 标题:On the Complexity of Reachability in Parametric Markov Decision Processes
  • 本地全文:下载
  • 作者:Tobias Winkler ; Sebastian Junges ; Guillermo A. Prez
  • 期刊名称:LIPIcs : Leibniz International Proceedings in Informatics
  • 电子版ISSN:1868-8969
  • 出版年度:2019
  • 卷号:140
  • 页码:1-17
  • DOI:10.4230/LIPIcs.CONCUR.2019.14
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要:This paper studies parametric Markov decision processes (pMDPs), an extension to Markov decision processes (MDPs) where transitions probabilities are described by polynomials over a finite set of parameters. Fixing values for all parameters yields MDPs. In particular, this paper studies the complexity of finding values for these parameters such that the induced MDP satisfies some reachability constraints. We discuss different variants depending on the comparison operator in the constraints and the domain of the parameter values. We improve all known lower bounds for this problem, and notably provide ETR-completeness results for distinct variants of this problem. Furthermore, we provide insights in the functions describing the induced reachability probabilities, and how pMDPs generalise concurrent stochastic reachability games.
  • 关键词:Parametric Markov decision processes; Formal verification; ETR; Complexity
国家哲学社会科学文献中心版权所有