DMCA
Reachability Analysis of Pushdown Automata: Application to Model-Checking (1997)
Cached
Download Links
| Citations: | 375 - 38 self |
BibTeX
@MISC{Bouajjani97reachabilityanalysis,
author = {Ahmed Bouajjani and Javier Esparza and Oded Maler},
title = {Reachability Analysis of Pushdown Automata: Application to Model-Checking},
year = {1997}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We apply the symbolic analysis principle to pushdown systems. We represent (possibly infinite) sets of configurations of such systems by means of finite-state automata. In order to reason in a uniform way about analysis problems involving both existential and universal path quantification (like model-checking for branching-time logics), we consider the more general class of alternating pushdown systems and use alternating finite-state automata as a representation structure for their sets of configurations. We give a simple and natural procedure to compute sets of predecessors for this representation structure. We apply this procedure and the automata-theoretic approach to model-checking to define new model-checking algorithms for pushdown systems and both linear and branching-time properties. From these results we derive upper bounds for several model-checking problems, and we also provide matching lower bounds, using reductions based on some techniques introduced by Walukiewicz.
Keyphrases
pushdown automaton reachability analysis representation structure finite-state automaton pushdown system uniform way symbolic analysis principle automata-theoretic approach analysis problem natural procedure branching-time property new model-checking algorithm several model-checking problem upper bound branching-time logic general class universal path quantification
