6 search results - page 2 / 2 » A coinductive calculus of binary trees |
136
Voted
STACS
2010
Springer
15 years 10 months ago
2010
Springer
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...