Chris Köcher

Researcher

About me

I am a postdoctoral researcher at the Max Planck Institute for Software Systems in Kaiserslautern. Here, I am part of the Models of Computation group headed by Georg Zetzsche's and work on the project FINABIS (FINite-state ABstractions of Infinite-state Systems) funded by the ERC.

Before that, I was a doctoral student at the Technische Universität Ilmenau in the Automata and Logics group led by Dietrich Kuske. I defended my dissertation on May 18th, 2022.

Photo by: Chris Liebold

Contact


Research Interests

  • Automata with various storage mechanisms
  • Formal verification of infinite state systems
  • Algebraic automata theory
  • Computability and Complexity

Work Experience

2016 - 2022

Researcher and Doctoral Student @ Technische Universität Ilmenau, Germany

2014 - 2016

Student Assistant @ Technische Universität Ilmenau, Germany

Education

2016 - 2022

Doctor rerum naturalium (Dr. rer. nat.) @ Technische Universität Ilmenau, Germany

Thesis: Verification of Automata with Storage Mechanisms (supervised by Dietrich Kuske)
2014 - 2016

Master of Science in Computer Science @ Technische Universität Ilmenau, Germany

Thesis: Einbettungen in das Transformationsmonoid einer vergesslichen Warteschlange (supervised by Dietrich Kuske)
2011 - 2014

Bachelor of Science in Computer Science @ Technische Universität Ilmenau, Germany

Thesis: Analyse der Entscheidbarkeit diverser Probleme in automatischen Graphen (supervised by Dietrich Kuske)

Teaching (in German)

Exercises

  • Automaten, Sprachen und Komplexität (WT 2015/16 - WT 20/21)
  • Automaten und Komplexität (ST 2020 - ST 2021)
  • Automatentheorie (ST 2019 - ST 2022)
  • Logik und Logikprogrammierung (ST 2017 - ST 2019)
  • Verifikation (WT 2016/17 - WT 2019/20)

Lectures

  • Automaten und Komplexität (ST 2021)
  • Automatentheorie (ST 2022)
  • Logik und Logikprogrammierung (ST 2021)
  • Verifikation (WT 2021/22)

Publications

Fully Refereed Journal Articles

  1. Rational, Recognizable, and Aperiodic Partially Lossy Queue Languages
    International Journal of Algebra and Computation, vol. 32(3), pages 483-528 (2022).
  2. Reachability Problems on Reliable and Lossy Queue Automata
    Theory of Computing Systems vol. 65(8), pages 1211-1242 (2021).
  3. The Inclusion Structure of Partially Lossy Queue Monoids and their Trace Submonoids (with Dietrich Kuske and Olena Prianychnykova)
    RAIRO - Theoretical Informatics and Applications vol. 52(1), pages 55-86 (2018).

Conference Contributions

  1. Reachability Problems on Partially Lossy Queue Automata
    RP 2019, Springer Lecture Notes in Computer Science vol. 11674, pages 149-163 (2019).
  2. The Cayley-Graph of the Queue Monoid: Logic and Decidability (with Faried Abu Zaid)
    FSTTCS 2018, Leibniz International Proceedings in Informatics vol. 122, pages 9:1-9:17 (2018).
  3. Rational, Recognizable, and Aperiodic Sets in the Partially Lossy Queue Monoid
    STACS 2018, Leibniz International Proceedings in Informatics vol. 96, pages 45:1-45:14 (2018).
  4. The Transformation Monoid of a Partially Lossy Queue (with Dietrich Kuske)
    CSR 2017, Springer Lecture Notes in Computer Science vol. 10304, pages 191-205 (2017).

Talks

  1. Verifying Multi-Pushdown Automata
    Highlights of Logic, Games and Automata 2022, Paris.
  2. Reachability Problems on Multi-Queue Automata
    Highlights of Logic, Games and Automata 2020, Online.
  3. Reachability Problems on Partially Lossy Queue Automata
    Highlights of Logic, Games and Automata 2019, Warsaw.
    13th International Conference on Reachability Problems 2019, Brussels.
    28. Theorietag "Automaten und Formale Sprachen" 2018, Wittenberg.
  4. The Cayley-Graph of the Queue Monoid: Logic and Decidability
    38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science 2018, Ahmedabad.
  5. Rational, Recognizable, and Aperiodic Sets in the Partially Lossy Queue Monoid
    Highlights of Logic, Games and Automata 2018, Berlin.
    35th Symposium on Theoretical Aspects of Computer Science 2018, Caen.
    27. Theorietag "Automaten und Formale Sprachen" 2017, Bonn.
  6. The Transformation Monoid of a Partially Lossy Queue
    12th International Computer Science Symposium in Russia 2017, Kazan.
  7. Analyse der Entscheidbarkeit diverser Probleme in automatischen Graphen (in German)
    24. Theorietag "Automaten und Formale Sprachen" 2014, Caputh.

Service

As a Reviewer

As an Organizer