Traditionally, model checking is applied to finite-state systems and regular specifications. While researchers have successfully extended the applicability of model checking to infinite-state systems, almost all existing work still consider regular specification formalisms. There are, however, many interesting non-regular properties one would like to model check. In this paper we study model checking of pushdown specifications. Our specification formalism is nondeterministic pushdown parity tree automata (PD-NPT).We show that the model-checking problem for regular systems and PD-NPT specifications can be solved in time exponential in the system and the specification. Our model-checking algorithm involves a new solution to the nonemptiness problem of nondeterministic pushdown tree automata, where we improve the best known upper bound from a triple-exponential to a single exponential. We also consider the model-checking problem for context-free systems and PD-NPT specifications and show that it is undecidable.
|Original language||American English|
|Title of host publication||Logic for Programming, Artificial Intelligence, and Reasoning - 9th International Conference, LPAR 2002, Proceedings|
|Editors||Matthias Baaz, Andrei Voronkov|
|Number of pages||16|
|ISBN (Print)||3540000100, 9783540000105|
|State||Published - 2002|
|Event||9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2002 - Tbilisi, Georgia|
Duration: 14 Oct 2002 → 18 Oct 2002
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2002|
|Period||14/10/02 → 18/10/02|
Bibliographical notePublisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.