4 citations · 4 across the 2 of their papers we have counts for
2 papers
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…
cs.LO2007
On a Non-Context-Free Extension of PDL
Stefan Göller, Dirk Nowotka
Over the last 25 years, a lot of work has been done on seeking for decidable non-regular extensions of Propositional Dynamic Logic (PDL). Only recently, an expressive extension of…