PhD thesis

• Computational Complexity of Propositional Dynamic Logics (University of Leipzig 2008)
  [PS][PDF]

Publications

in journals

• Fixpoint logics on hierarchical structures (with Markus Lohrey)
  [PS][PDF]
to appear in Theory of Computing Systems

• PDL with Intersection and Converse: Satisfiability and Infinite-State Model Checking
  (with Markus Lohrey and Carsten Lutz)
  [PS][PDF]
Journal of Symbolic Logic, Volume 74, Issue 1 (2009), pp. 279-314

• Reachability on prefix-recognizable graphs
  [PS][PDF]
Information Processing Letters, Volume 108, Issue 2, 30 September 2008, pp. 71-74

• A Note on an Extension of PDL (with Dirk Nowotka)
  [PDF] [PS] ArXiv version
Journal of Applied Logic, Volume 6, Issue 4, December 2008, pp. 606-608.

in conference proceedings

• The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers (with Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas and Felix Weiß)
  to appear in Proceedings of the Ninth Bi-Annual Conference on Advances in Modal Logic (AiML) 2012, pp. ???-???
  © College Publications
  

• The complexity of decomposing modal and first-order theories (with Jean Christoph Jung and Markus Lohrey)
  to appear in Proceedings of the Twenty-Seventh Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) 2012, pp. ???-???
  [PDF] [PS]
  © ACM/IEEE

• Branching-Time Model Checking of Parametric One-Counter Automata (with Christoph Haase, Joël Ouaknine, and James Worrell)
  to appear in Proceedings of Foundations of Software Science and Computation Structures (FoSSaCS 2012), pp.???-???, volume ??? LNCS series
  [PDF] [PS]
  © Springer-Verlag

• Concurreny Makes Simple Theories Hard (with Anthony Widjaja Lin)
  to appear in Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science (STACS) 2012, pp. ???-???
  [PDF] [PS]
  © Dagstuhl - Leibniz-Zentrum fuer Informatik

• The First-Order Theory of Ground Tree Rewrite Graphs (with Markus Lohrey)
  [PDF] [PS] [technical report]
  to appear in Proceedings of Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2011
  © Dagstuhl - Leibniz-Zentrum fuer Informatik

• Language equivalence of deterministic real-time one-counter automata is NL-complete (with Stanislav Böhm)
  to appear in Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS), 2011
  [PDF] [PS]
  © Springer-Verlag
  

• Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems (with Anthony Widjaja Lin)
  to appear in Proceedings of the 22nd International Conference on Concurrency Theory (CONCUR), 2011
  [PDF] [PS]
  © Springer-Verlag
  

• The Complexity of Verifying Ground Tree Rewrite Systems (with Anthony Widjaja Lin)
  to appear in Proceedings of the Twenty-Sixth Annual IEEE Symposium on Logic in Computer Science (LICS 2011)
  [PDF] [PS] [technical report (PDF)] [technical report (PS)]
  © IEEE

• Bisimilarity of one-counter processes is PSPACE-complete (with Stanislav Böhm and Petr Jančar)
  in Proceedings of the 21st International Conference on Concurrency Theory (CONCUR), 2010 pp.177-191, volume 6269 in LNCS series
  [PDF] [PS] [technical report]
  © Springer-Verlag

• Model Checking Succinct and Parametric One-Counter Automata (with Christoph Haase, Joël Ouaknine, and James Worrell)
  in Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP), Track B, pp.575-586, volume 6199 in LNCS series
  [PDF] [PS] [technical report]
  © Springer-Verlag

• Branching-time model checking of one-counter processes (with Markus Lohrey)
  Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS) 2010, pp. 405-416
  [PDF] [PS] Arxiv link
  © Dagstuhl - Leibniz-Zentrum fuer Informatik

• On the Computational Complexity of Verifying One-Counter Processes (with Richard Mayr and Anthony Widjaja To)
  [PDF] [PS]
  Proceedings of Logic in Computer Science (LICS) 2009, pp.235-244
  © IEEE

• On the Complexity of Reasoning about Dynamic Policies
  [PS][PDF]
  Proceedings of Computer Science Logic 2007, pp.358-373, volume 4646 LNCS series
  © Springer-Verlag

• PDL with Intersection and Converse is 2EXP-complete (with Markus Lohrey and Carsten Lutz)
  [PS] [PDF]
  Proceedings of FoSSaCS 2007, pp.198-212, volume 4423 LNCS series
  © Springer-Verlag

• Infinite-state model-checking of Propositional Dynamic Logics (with Markus Lohrey )
  [PS] [PDF] [technical report] [Talk (PDF)]
  Proceedings of Computer Science Logic 2006, pp.349-364, volume 4207 LNCS series
  © Springer-Verlag

• Fixpoint logics on hierarchical structures (with Markus Lohrey )
  [PS] [PDF] [technical report]
  Proceedings of FST&TCS 2005, pp.483-494, volume 3821 LNCS series
  © Springer-Verlag