AddressMathematische Grundlagen der Informatik
|Email:||lessenich [AT] logic.rwth-aachen.de|
ResearchI worked as a research assistant at the Mathematical Foundations of Computer Science group from January 2012 to March 2015, and obtained my PhD in May 2015.
From January 2012 to December 2014 I was a scholarship holder of the DFG Research Training Group AlgoSyn.
From May 2011 to November 2011 I was visiting LSV, ENS Cachan.
My research interests include:
- Infinite Games on Graphs
- Quantitative Logics
- Counting Mechanisms in Games and Logics
- Winter Term 2014
- Summer Term 2014
- Winter Term 2013
- Summer Term 2013
- Winter Term 2012
- Summer Term 2012
- F. Canavoi, E. Grädel, S. Lessenich, and W. Pakusa. Defining winning strategies in fixed-point logic. In Proceedings of 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2015.
- Ł. Kaiser, M. Lang, S. Lessenich, and C. Löding. A Unified Approach to Boundedness Properties in MSO. In 24th EACSL Annual Conference on Computer Science Logic (CSL 2015) (S. Kreutzer, Ed.), vol. 41 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 441–456, Dagstuhl, Germany. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2015.
- S. Lessenich. Counting Logics and Games with Counters. PhD thesis, RWTH Aachen University, 2015.
- D. Berwanger, Ł. Kaiser, and S. Lessenich. Solving Counter Parity Games. In Mathematical Foundations of Computer Science 2012 (B. Rovan, V. Sassone, and P. Widmayer, Eds.), vol. 7464 of Lecture Notes in Computer Science, pp. 160-171. Springer Berlin / Heidelberg, 2012.
- E. Grädel and S. Lessenich. Banach-Mazur Games with Simple Winning Strategies. In Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL (P. Cégielski and A. Durand, Eds.), vol. 16 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 305–319, Dagstuhl, Germany. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2012.