ICALP
1997
Springer
14 years 4 months ago
1997
Springer
In this paper we develop a new elementary algorithm for model-checking infinite sequential processes, including context-free processes, pushdown processes, and regular graphs, tha...
FSTTCS
2004
Springer
14 years 5 months ago
2004
Springer
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...