Advertisement
Published in:
2000 | OriginalPaper | Chapter
Model Checking CTL Properties of Pushdown Systems
Author : Igor Walukiewicz
Published in: FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.