A Note on the Complexity of Model-Checking Bounded Multi-Pushdown Systems

Abstract

In this note, we provide complexity characterizations of model checking multi-pushdown systems. Multi-pushdown systems model recursive concurrent programs in which any sequential process has a finite control. We consider three standard notions for boundedness: context boundedness, phase boundedness and stack ordering. The logical formalism is a linear-time… (More)

Topics

2 Figures and Tables

Cite this paper

@article{Bansal2012ANO, title={A Note on the Complexity of Model-Checking Bounded Multi-Pushdown Systems}, author={Kshitij Bansal and St{\'e}phane Demri}, journal={CoRR}, year={2012}, volume={abs/1212.1485} }