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

随机分支过程的模型检验

Model Checking Stochastic Branching Processes

Taolue Chen, Klaus Dräger, Stefan Kiefer

摘要:

随机分枝过程是描述随机树的经典模型,在生物学、物理学和自然语言处理等领域有着广泛的应用。特别是,他们最近被提出来描述随机过程创建并行程序。本文考虑随机分支过程的模型检验问题。给定一个分支过程和一个确定性奇偶校验树自动机,我们感兴趣的是计算生成的随机树被自动机接受的概率。我们表明,这个概率可以与任何有理数在PSPACE,和0和1在多项式时间。在第二部分中,我们提出了逻辑PCTL的一个树扩展,并开发了一个PSPACE算法,用于对这个逻辑的公式进行分支过程的模型检验。我们还表明,该逻辑的定性片段可以在多项式时间内进行模型检查。

英文摘要:

Stochastic branching processes are a classical model for describing random trees, which have applications in numerous fields including biology, physics, and natural language processing. In particular, they have recently been proposed to describe parallel programs with stochastic process creation. In this paper, we consider the problem of model checking stochastic branching process. Given a branching process and a deterministic parity tree automaton, we are interested in computing the probability that the generated random tree is accepted by the automaton. We show that this probability can be compared with any rational number in PSPACE, and with 0 and 1 in polynomial time. In a second part, we suggest a tree extension of the logic PCTL, and develop a PSPACE algorithm for model checking a branching process against a formula of this logic. We also show that the qualitative fragment of this logic can be model checked in polynomial time.

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

↑