Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems
Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems
复制标题
定时寄存器下推自动机和分支向量加法系统的二进制可达性
DOI:
10.1145/3326161
复制
发表时间:
2019
影响因子:
0.5
通讯作者:
Clemente L
中科院分区:
文献类型:
--
作者:
Clemente L
Timed-register pushdown automata constitute a very expressive class of automata, whose transitions may involve state, input, and top-of-stack timed registers with unbounded differences. They strictly subsume pushdown timed automata of Bouajjani et al., dense-timed pushdown automata of Abdulla et al., and orbit-finite timed-register pushdown automata of Clemente and Lasota. We give an effective logical characterisation of the reachability relation of timed-register pushdown automata. As a corollary, we obtain a doubly exponential time procedure for the non-emptiness problem. We show that the complexity reduces to singly exponential under the assumption of monotonic time. The proofs involve a novel model of one-dimensional integer branching vector addition systems with states. As a result interesting on its own, we show that reachability sets of the latter model are semilinear and computable in exponential time.
登录
查看更多内容
DOI:
10.1016/j.ipl.2010.06.008
发表时间:
2010
期刊:
Inf. Process. Lett.
影响因子:
--
作者:
R. Lazic
通讯作者:
R. Lazic
DOI:
10.1007/3-540-58179-0_48
发表时间:
1994
期刊:
2012 27th Annual IEEE Symposium on Logic in Computer Science
影响因子:
--
作者:
A. Bouajjani;R. Echahed;R. Robbana
通讯作者:
R. Robbana
DOI:
--
发表时间:
2016
期刊:
--
影响因子:
--
作者:
Goeller S
通讯作者:
Goeller S
DOI:
10.4230/lipics.csl.2015.244
发表时间:
2015
期刊:
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science
影响因子:
--
作者:
Lorenzo Clemente;S. Lasota
通讯作者:
S. Lasota
DOI:
10.1016/j.ic.2014.12.004
发表时间:
2013-02
期刊:
--
影响因子:
--
作者:
John Fearnley;M. Jurdzinski
通讯作者:
John Fearnley;M. Jurdzinski