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

分支时间模型检验间隙顺序约束系统(扩展版)

Branching-Time Model Checking Gap-Order Constraint Systems (Extended Version)

Richard Mayr, Patrick Totzke

摘要:

研究了带间隙序约束系统的模型检验问题。分支时间时序逻辑CTL,特别是它的片段EG和EF。GCS是由整数值变量的演化描述的非确定性无限分支过程,服从形式为$x-y\ge k$的Presburger约束,其中$x$和$y$是变量或常数,$k\in\mathbb{N}$是非负常数。我们表明,EG模型检验是不可判定的GCS,而EF是可判定的。特别是,这意味着GCS和有限状态系统之间的强和弱互模拟等价的可判定性。

英文摘要:

We consider the model checking problem for Gap-order Constraint Systems (GCS) w.r.t. the branching-time temporal logic CTL, and in particular its fragments EG and EF. GCS are nondeterministic infinitely branching processes described by evolutions of integer-valued variables, subject to Presburger constraints of the form $x-y\ge k$, where $x$ and $y$ are variables or constants and $k\in\mathbb{N}$ is a non-negative constant. We show that EG model checking is undecidable for GCS, while EF is decidable. In particular, this implies the decidability of strong and weak bisimulation equivalence between GCS and finite-state systems.

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

↑