向量可加系统可达集的可分性
Separability of Reachability Sets of Vector Addition Systems
摘要:
给定两个集合族$\mathcal{F}$和$\mathcal{G}$,$\mathcal{G}$的$\mathcal{F}$可分性问题询问对于两个给定集合$U, V \in \mathcal{G}$是否存在集合$S \in \mathcal{F}$,使得$U$包含在$S$中,并且$V$与$S$不相交。我们考虑两个家庭的集$\mathcal{F}$:模块集$S \subseteq \mathbb{N}^d$,定义为工会的等价类模一些自然数$n \in \mathbb{N}$,和一元集。我们的主要结果是可判定性的模块和一元可分性的类$\mathcal{G}$的可达集的向量加法系统,Petri网,向量加法系统的状态,并为部分。
英文摘要:
Given two families of sets $\mathcal{F}$ and $\mathcal{G}$, the $\mathcal{F}$ separability problem for $\mathcal{G}$ asks whether for two given sets $U, V \in \mathcal{G}$ there exists a set $S \in \mathcal{F}$, such that $U$ is included in $S$ and $V$ is disjoint with $S$. We consider two families of sets $\mathcal{F}$: modular sets $S \subseteq \mathbb{N}^d$, defined as unions of equivalence classes modulo some natural number $n \in \mathbb{N}$, and unary sets. Our main result is decidability of modular and unary separability for the class $\mathcal{G}$ of reachability sets of Vector Addition Systems, Petri Nets, Vector Addition Systems with States, and for sections thereof.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。