14 citations · 74 across the 41 of their papers we have counts for
Showing 2009 · cs.LOShow all
2 papers · 2 filters
cs.LO2009
Branching-time model checking of one-counter processes
Stefan Göller, Markus Lohrey
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 (CT…
cs.LO2009★ 4 cited
Branching-time model checking of one-counter processes
Stefan Göller, Markus Lohrey
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 (CT…