2026-08-17T16:33:26Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2472 2024-03-06T10:33:24Z ddc:004 open_access

Branching-time Model Checking of One-counter Processes Göller, Stefan Lohrey, Markus Model checking computation tree logic complexity theory One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic ($\CTL$) over OCPs. A $\PSPACE$ 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 control locations and a syntactic notion of the formula that we call leftward until depth. Thus, model checking fixed OCPs against $\CTL$ formulas with a fixed leftward until depth is in $\P$. This generalizes a result of the first author, Mayr, and To for the expression complexity of $\CTL$'s fragment $\EF$. Second, we prove that already over some fixed OCP, $\CTL$ model checking is $\PSPACE$-hard. Third, we show that there already exists a fixed $\CTL$ formula for which model checking of OCPs is $\PSPACE$-hard. For the latter, we employ two results from complexity theory: (i) Converting a natural number in Chinese remainder presentation into binary presentation is in logspace-uniform $\NC^1$ and (ii) $\PSPACE$ is $\AC^0$-serializable. We demonstrate that our approach can be used to answer further open questions. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Stefan Göller and Markus Lohrey 2010 Is Part Of LIPIcs, Volume 5, 27th International Symposium on Theoretical Aspects of Computer Science (2010) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.STACS.2010.2472 urn:nbn:de:0030-drops-24722 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2472 eng https://creativecommons.org/licenses/by-nd/3.0/legalcode