arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1902.05727cs.LOcs.AI
收藏

马尔可夫链的牧羊群

Shepherding Hordes of Markov Chains

Brno University of Technology(布尔诺理工大学);Radboud University(拉德堡德大学);RWTH Aachen University(亚琛工业大学)

Milan Ceska, Nils Jansen, Sebastian Junges, Joost-Pieter Katoen

摘要:

本文考虑了定义在一组参数上的具有有限离散域的马氏链(MC)的大家族。这样的家庭出现在软件产品线,规划下的部分可观测性,和概率程序的草图。简单的问题,比如“至少有一个家庭成员满足一个属性吗?是NP难的。我们解决两个问题:区分满足给定数量特性的家族成员与不满足给定数量特性的家族成员,并且确定最优地满足该特性的家族成员,即,有最高的概率或回报。我们表明,结合两个著名的技术,MDP模型检验和抽象细化,减轻了计算复杂性。一组广泛的基准测试的实验表明,在许多情况下,我们的方法是能够处理数百万个MC的家庭,提供卓越的可扩展性相比,现有的解决方案。

英文摘要:

This paper considers large families of Markov chains (MCs) that are defined over a set of parameters with finite discrete domains. Such families occur in software product lines, planning under partial observability, and sketching of probabilistic programs. Simple questions, like `does at least one family member satisfy a property?', are NP-hard. We tackle two problems: distinguish family members that satisfy a given quantitative property from those that do not, and determine a family member that satisfies the property optimally, i.e., with the highest probability or reward. We show that combining two well-known techniques, MDP model checking and abstraction refinement, mitigates the computational complexity. Experiments on a broad set of benchmarks show that in many situations, our approach is able to handle families of millions of MCs, providing superior scalability compared to existing solutions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑