firstname . lastname (at) this host s/www2.tcs.ifi.lmu/uni-bayreuth/ or
firstname . lastname (at) this host s/www2.tcs.//
Modal and Temporal Logics,
Markus Latte and Matthias Niewerth Definability by weakly deterministic regular expressions with counters is decidable In Giuseppe F. Italiano, Giovanni Pighizzini, and Donald T. Sannella, editors, Mathematical Foundations of Computer Science 2015 (Part I), volume 9234 of Lecture Notes in Computer Science, pages 369–381. Springer, 2015. The final publication is available at Springer.
[BIBTEX entry, preprint with appendix as pdf]
Markus Latte Separation of test-free Propositional Dynamic Logics over context-free languages In Giovanna D'Agostino and Salvatore La Torre, editors, Proceedings of the 2nd International Symposium on Games, Automata, Logics and Formal Verification (GandALF 2011, Minori, Italy), volume 54 of EPTCS, pages 207–221, 2011. Available at http://arxiv.org/abs/1106.1242.
[BIBTEX entry, slides as pdf]
Oliver Friedmann and Markus Latte Decision Procedures for CTL* In Proceedings of the 2010 International Workshop on Comparing Logical Decision Methods (CLoDeM 2010, Edinburgh, United Kingdom), 2010.
[BIBTEX entry, preprint as pdf, slides as pdf]
Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, and Markus Latte Extended Computation Tree Logic In Christian Fermüller and Andrei Voronkov, editors, Proceedings of the 17th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2010, Yogyakarta, Indonesia), volume 6397 of Lecture Notes in Computer Science, pages 67–81. Springer, 2010. The original publication is available at www.springerlink.com.
[BIBTEX entry, preprint as pdf]