La Torre, Salvatore and Gennaro, Parlato
Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width
At 32nd Foundations of Software Technology and Theoretical Computer Science Conference (FSTTCS), India.
15 - 17 Dec 2012.
12 pp, .
We present a novel fixed-point algorithm to solve reachability of multi-stack pushdown systems restricted to runs of bounded-scope. The followed approach is compositional, in the sense that the runs of the system are summarized by bounded-size interfaces. Moreover, it is suitable for a direct implementation and can be exploited to prove two new results. We give a sequentialization for this class of systems, i.e., for each such multi-stack pushdown system we construct an equivalent single-stack pushdown system that faithfully simulates the behaviour of each thread. We prove that the behaviour graphs (multiply nested words) for these systems have bounded three-width, and thus a number of decidability results can be derived from Courcelle’s theorem.
Actions (login required)