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

不确定概率系统的加细

Refinement for Probabilistic Systems with Nondeterminism

Steve Reeves, David Streader

摘要:

在我们结合行动和概率之前,应该问两个非常明显的问题。第一,“行动的可能性”是什么意思?其次,概率如何与非决定论相互作用?这两个问题都没有一个普遍认同的答案,但通过在一开始就考虑这些问题,我们建立了一个新颖的,希望直观的概率基于事件的形式主义。在以前的工作中,我们已经通过测试的概念来表征细化。基本上,如果一个系统通过了另一个系统通过的所有测试(也许更多),我们就说第一个系统是第二个系统的改进。在我们看来,这是一个重要的方式来描述细化,通过问题“我应该使用什么样的细化?“我们在本文中使用测试作为我们改进的基础。我们开发测试的概率系统类比开发的非概率系统的测试。我们确保我们的概率测试,在非概率自动机上进行时,给我们的细化关系,同意这些非概率自动机。我们将此属性形式化为垂直细化。

英文摘要:

Before we combine actions and probabilities two very obvious questions should be asked. Firstly, what does "the probability of an action" mean? Secondly, how does probability interact with nondeterminism? Neither question has a single universally agreed upon answer but by considering these questions at the outset we build a novel and hopefully intuitive probabilistic event-based formalism. In previous work we have characterised refinement via the notion of testing. Basically, if one system passes all the tests that another system passes (and maybe more) we say the first system is a refinement of the second. This is, in our view, an important way of characterising refinement, via the question "what sort of refinement should I be using?" We use testing in this paper as the basis for our refinement. We develop tests for probabilistic systems by analogy with the tests developed for non-probabilistic systems. We make sure that our probabilistic tests, when performed on non-probabilistic automata, give us refinement relations which agree with for those non-probabilistic automata. We formalise this property as a vertical refinement.

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

↑