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

通过合并验证无界性

Verifying Unboundedness via Amalgamation

Ashwani Anand, Sylvain Schmitz, Lia Schütze, Georg Zetzsche

AI总结:

该研究提出配备良拟序且支持运行合并的抽象系统概念,涵盖VAS、PDS等多类无限状态系统,为无界性相关问题提供通用简洁的算法方案,带来简化证明或新的可判定性结果。

摘要:

良结构迁移系统(WSTS)是一类抽象系统,涵盖了种类繁多的无限状态系统。通过要求状态集合上存在良拟序(wqo),WSTS 可为覆盖性、终止性等经典验证任务提供通用算法。然而,即便对于向量加法系统(VAS)这类属于 WSTS 的系统,该框架也极不擅长分析可达性(与覆盖性相对)。此外,一些重要的无限状态系统类型完全不在 WSTS 的研究范围内,例如下推系统(PDS)。\n受近期 VAS 相关算法技术的启发,我们提出了一种抽象系统概念:这类系统的运行集合上配备 wqo,且支持运行合并。我们证明该概念涵盖了一大类无限状态系统,包括 VAS 和 PDS(的可达性语言),甚至包括价系统抽象框架下的所有系统——仅那些已知为图灵完备的系统除外。\n此外,这一抽象设置为近年来备受关注的无界性问题提供了简洁通用的算法解决方案。我们提出了针对以下问题的算法:(i)同时无界性问题(其意味着向下闭包的可计算性,以及分段可测试语言可分性的可判定性);(ii)优先级向下闭包的计算;(iii)判定某语言是否有界,即是否存在字 $w_1,\ldots,w_k$ 使得该语言包含于 $w_1^*\cdots w_k^*$;(iv)一元语言的有效正则性。这为各类系统带来了要么大幅简化的证明,要么全新的可判定性结果。

英文摘要:

Well-structured transition systems (WSTS) are an abstract family of systems that encompasses a vast landscape of infinite-state systems. By requiring a well-quasi-ordering (wqo) on the set of states, a WSTS enables generic algorithms for classic verification tasks such as coverability and termination. However, even for systems that are WSTS like vector addition systems (VAS), the framework is notoriously ill-equipped to analyse reachability (as opposed to coverability). Moreover, some important types of infinite-state systems fall out of WSTS' scope entirely, such as pushdown systems (PDS). Inspired by recent algorithmic techniques on VAS, we propose an abstract notion of systems where the set of runs is equipped with a wqo and supports amalgamation of runs. We show that it subsumes a large class of infinite-state systems, including (reachability languages of) VAS and PDS, and even all systems from the abstract framework of valence systems, except for those already known to be Turing-complete. Moreover, this abstract setting enables simple and general algorithmic solutions to unboundedness problems, which have received much attention in recent years. We present algorithms for the (i) simultaneous unboundedness problem (which implies computability of downward closures and decidability of separability by piecewise testable languages), (ii) computing priority downward closures, (iii) deciding whether a language is bounded, meaning included in $w_1^*\cdots w_k^*$ for some words $w_1,\ldots,w_k$, and (iv) effective regularity of unary languages. This leads to either drastically simpler proofs or new decidability results for a rich variety of systems.

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

↑