Model Checking CTL Properties of Pushdown Systems

: A pushdown system is a graph G(P) of configurations of a pushdown automaton P. The model checking problem for a logic L is: given a pushdown automaton P and a formula L decide if holds in the vertex of G(P) which is the initial configuration of P. Computation Tree Logic (CTL) and its fragment EF are considered. The model checking problems for CTL and EF are shown to be EXPTIME-complete and PSPACE-complete, respectively.

• Type: Conference
• Year: 2000
• Where: FSTTCS
• Authors: Igor Walukiewicz
• Keywords: Computation Tree Logic, FSTTCS 2000, Model Checking Problems, Pushdown Automaton, Software Engineering