arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1212.4288cs.LO
收藏

概率自动机的加细与差分

Refinement and Difference for Probabilistic Automata

Benoît Delahaye, Uli Fahrenberg, Kim G. Larsen, Axel Legay

摘要:

本文研究了随机系统的差分算子,其规格用抽象概率自动机(APAs)表示。在细化在两个规范之间失败的情况下,该操作符的目标是产生一个规范APA,该规范APA表示该失败的所有见证PA。我们的贡献是一个算法,允许近似的差异,两个APA任意精度。我们的技术依赖于新的定量概念的APA之间的距离,用于评估收敛的近似,以及对APA的细化关系的深入检查。该过程是有效的,并且不比细化检查更复杂。

英文摘要:

This paper studies a difference operator for stochastic systems whose specifications are represented by Abstract Probabilistic Automata (APAs). In the case refinement fails between two specifications, the target of this operator is to produce a specification APA that represents all witness PAs of this failure. Our contribution is an algorithm that allows to approximate the difference of two APAs with arbitrary precision. Our technique relies on new quantitative notions of distances between APAs used to assess convergence of the approximations, as well as on an in-depth inspection of the refinement relation for APAs. The procedure is effective and not more complex to implement than refinement checking.

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

↑