跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2401.16095 · v4

On the Separability Problem of VASS Reachability Languages

首次提交 2024-01-29 20:10
版本更新 2026-11-16 23:58
雷达观测 2026-11-17 16:10
arXiv ↗PDF ↗

摘要

We show that the regular separability problem of VASS reachability languages is decidable and Fω\mathbf{F}_ω-complete. At the heart of our decision procedure are doubly-marked graph transition sequences, a new proof object that tracks a suitable product of the VASS we wish to separate. We give a decomposition algorithm for DMGTS that not only achieves perfectness as known from MGTS, but also a new property called faithfulness. Faithfulness allows us to construct, from a regular separator for the Z\mathbb{Z}-versions of the VASS, a regular separator for the N\mathbb{N}-versions. Behind faithfulness is the insight that, for separability, it is sufficient to track the counters of one VASS modulo a large number that is determined by the decomposition.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v4,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v4 · 2026-11-16 23:58 · 最新观测版本

On the Separability Problem of VASS Reachability Languages

We show that the regular separability problem of VASS reachability languages is decidable and Fω\mathbf{F}_ω-complete. At the heart of our decision procedure are doubly-marked graph transition sequences, a new proof object that tracks a suitable product of the VASS we wish to separate. We give a decomposition algorithm for DMGTS that not only achieves perfectness as known from MGTS, but also a new property called faithfulness. Faithfulness allows us to construct, from a regular separator for the Z\mathbb{Z}-versions of the VASS, a regular separator for the N\mathbb{N}-versions. Behind faithfulness is the insight that, for separability, it is sufficient to track the counters of one VASS modulo a large number that is determined by the decomposition.

查看此版本解读 →查看此版本原文 ↗