Reachability Analysis of First-order Definable Pushdown Systems
Reachability Analysis of First-order Definable Pushdown Systems
复制标题
一阶可定义下推系统的可达性分析
DOI：
10.4230/lipics.csl.2015.244
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
S. Lasota
中科院分区：
文献类型：
--
作者：
Lorenzo Clemente;S. Lasota
我们研究下推系统，其中控制状态、堆栈字母表和转换关系不是有限的，而是在固定的可数无限结构中是一阶可定义的。我们证明了可达性分析可以用广为人知的饱和技术来处理。此外，对于更具限制性的同质结构，我们能够给出具体的复杂性上界。我们通过提供几个同质结构的具体例子来展示我们的技术的充分适用性，以最佳的复杂性归并来自文献的已知结果。我们证明了用经典的圈积构造可以得到无穷多个这样的均匀结构的例子。
We study pushdown systems where control states, stack alphabet, and transition relation, instead of being finite, are first-order definable in a fixed countably-infinite structure. We show that the reachability analysis can be addressed with the well-known saturation technique for the wide class of oligomorphic structures. Moreover, for the more restrictive homogeneous structures, we are able to give concrete complexity upper bounds. We show ample applicability of our technique by presenting several concrete examples of homogeneous structures, subsuming, with optimal complexity, known results from the literature. We show that infinitely many such examples of homogeneous structures can be obtained with the classical wreath product construction.
下推寄存器自动机的可达性
影响因子：
1.1
作者：
Murawski A
通讯作者：
Murawski A