Branching-time Model Checking of One-counter Processes

@inproceedings{Gller2010BranchingtimeMC,
  title={Branching-time Model Checking of One-counter Processes},
  author={Stefan G{\"o}ller and Markus Lohrey},
  booktitle={STACS},
  year={2010}
}
One-counter processes (OCPs) are pushdown processes whic h operate only on a unary stack alphabet. We study the computational complexity of mo del checking computation tree logic (CTL) over OCPs. APSPACE upper bound is inherited from the modal mu-calculus for this problem. First, we analyze the periodic behaviour of CTL over OCPs and derive a model checking algorithm whose running time is exponential only in the number of contr ol locations and a syntactic notion of the formula that we call… CONTINUE READING
Highly Cited
This paper has 21 citations. REVIEW CITATIONS