Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
复制标题
高阶下推系统的符号向后可达性分析
DOI：
10.2168/lmcs-4(4:14)2008
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
C. Ong
中科院分区：
文献类型：
--
作者：
M. Hague;C. Ong
高阶俯卧撑系统（PDSS）通过使用高阶堆栈来概括下降系统，即嵌套的“堆栈堆栈”结构。向后反应问题这些系统。在n-extime中可计算。我们表明，结果在验证高阶PDS（例如LTL模型检查，无替代的µ-Calculus模型检查以及计算可及性游戏的获胜区域）时具有多个有用的应用程序。
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested "stack of stacks" structure. We further generalise higher-order PDSs to higher-order Alternating PDSs (APDSs) and consider the backwards reachability problemover these systems.We prove that given an order-n APDS, the set of configurations from which a given regular set of configurations is reachable is itself regular and computable in n-EXPTIME. We show that the result has several useful applications in the verification of higher-order PDSs such as LTL model checking, alternation-free µ-calculus model checking, and the computation of winning regions of reachability games.