 | 2009 |
|---|
| 10 |       | Stefan Göller,
Richard Mayr,
Anthony Widjaja To:
On the Computational Complexity of Verifying One-Counter Processes.
LICS 2009: 235-244 |
| 9 | | Stefan Göller,
Markus Lohrey:
Branching-time model checking of one-counter processes
CoRR abs/0909.1102: (2009) |
| 2008 |
|---|
| 8 | | Stefan Göller:
Reachability on prefix-recognizable graphs.
Inf. Process. Lett. 108(2): 71-74 (2008) |
| 7 | | Stefan Göller,
Dirk Nowotka:
A note on an extension of PDL.
J. Applied Logic 6(4): 606-608 (2008) |
| 2007 |
|---|
| 6 | | Stefan Göller,
Markus Lohrey,
Carsten Lutz:
PDL with Intersection and Converse is 2EXP-complete.
Algorithmic-Logical Theory of Infinite Structures 2007 |
| 5 | | Stefan Göller:
On the Complexity of Reasoning About Dynamic Policies.
CSL 2007: 358-373 |
| 4 | | Stefan Göller,
Markus Lohrey,
Carsten Lutz:
PDL with Intersection and Converse Is 2 EXP-Complete.
FoSSaCS 2007: 198-212 |
| 3 | | Stefan Göller,
Dirk Nowotka:
On a Non-Context-Free Extension of PDL
CoRR abs/0707.0562: (2007) |
| 2006 |
|---|
| 2 | | Stefan Göller,
Markus Lohrey:
Infinite State Model-Checking of Propositional Dynamic Logics.
CSL 2006: 349-364 |
| 2005 |
|---|
| 1 | | Stefan Göller,
Markus Lohrey:
Fixpoint Logics on Hierarchical Structures.
FSTTCS 2005: 483-494 |
