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

定量性质与自动机的安全性和活性

Safety and Liveness of Quantitative Properties and Automata

Udi Boker, Thomas A. Henzinger, Nicolas Mazzocchi, N. Ege Saraç

AI总结:

本文将布尔性质的安全性-活性分类扩展到定量域,定义定量安全性和活性,证明其保守泛化布尔对应结构,建立与拓扑连续性联系,并为自动机表达的定量性质提供判定、闭包构造和分解方法。

摘要:

安全性和活性是形式语言中的基本概念,在验证中起着关键作用。布尔性质的安全性-活性分类描述了给定性质是否可以通过观察无限计算轨迹的有限前缀来证伪(安全性始终可以,活性永远不可以)。在定量设置中,性质是从无限单词到偏序域的任意函数。将这一范式扩展到定量域,我们引入并研究了定量安全性和活性的概念。首先,我们正式定义了定量安全性和活性,并证明我们的定义诱导了布尔性质的安全性-进展层次结构和安全性-活性分解的保守定量泛化。因此,与布尔对应物类似,定量性质可以最小分解为安全性和活性部分,或者最大分解为共安全性和共活性部分。我们进一步建立了定量安全性与拓扑连续性之间的联系,并根据其布尔类似物提供了定量安全性和活性的替代表征。其次,我们用自动机表达的特定定量性质类实例化我们的框架。这些定量自动机包含有限多个状态和有理值转移权重,其常用值函数Inf、Sup、LimInf、LimSup、LimInfAvg、LimSupAvg和DSum将无限单词映射到实数的全序域。对于所有常用值函数,我们提供了一个判定给定自动机是否安全或活性的过程,展示了如何构造其安全闭包,并提出了将其最小分解为安全自动机和活性自动机的方法。

英文摘要:

Safety and liveness stand as fundamental concepts in formal languages, playing a key role in verification. The safety-liveness classification of boolean properties characterizes whether a given property can be falsified by observing a finite prefix of an infinite computation trace (always for safety, never for liveness). In the quantitative setting, properties are arbitrary functions from infinite words to partially-ordered domains. Extending this paradigm to the quantitative domain, where properties are arbitrary functions mapping infinite words to partially-ordered domains, we introduce and study the notions of quantitative safety and liveness. First, we formally define quantitative safety and liveness, and prove that our definitions induce conservative quantitative generalizations of both the safety-progress hierarchy and the safety-liveness decomposition of boolean properties. Consequently, like their boolean counterparts, quantitative properties can be min-decomposed into safety and liveness parts, or alternatively, max-decomposed into co-safety and co-liveness parts. We further establish a connection between quantitative safety and topological continuity and provide alternative characterizations of quantitative safety and liveness in terms of their boolean analogs. Second, we instantiate our framework with the specific classes of quantitative properties expressed by automata. These quantitative automata contain finitely many states and rational-valued transition weights, and their common value functions Inf, Sup, LimInf, LimSup, LimInfAvg, LimSupAvg, and DSum map infinite words into the totally-ordered domain of real numbers. For all common value functions, we provide a procedure for deciding whether a given automaton is safe or live, we show how to construct its safety closure, and we present a min-decomposition into safe and live automata.

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

↑