http://www.tu-ilmenau.de

Logo TU Ilmenau


INHALTE

M.Sc. Chris Köcher

EMail:chris.koecher@tu-ilmenau.de
GPG key:46A1 9C9D 1AFB 92F2 EC14 AA33 137A 44FE E822 9540
Phone:+49 3677 69-4158
Office:Zusebau, Room 1055 (Sector E, 1st floor)
Address:Automata and Logics Group
Department of Computer Science and Automation
Technische Universität Ilmenau
Postfach 100565
98684 Ilmenau
Office hours:Anytime or on appointment
CV:Download
External Links:DBLP
Google Scholar
ORCID
ResearchGate

Teaching

Publications

Submitted Papers

  1. Reachability Problems on Partially Lossy Queue Automata (version: october 2019)
    [Download]

Fully refereed Papers

  1. The Inclusion Structure of Partially Lossy Queue Monoids and their Trace Submonoids (with Dietrich KuskeOlena Prianychnykova)
    RAIRO - Theoretical Informatics and Applications vol. 52(1), pages 55-86 (2018).
    [Download, DOI: 10.1051/ita/2018003, BibTeX

Conference Papers

  1. Reachability Problems on Partially Lossy Queue Automata
    RP 2019, Springer Lecture Notes in Computer Science vol. 11674, pages 149-163 (2019).
    [Download, DOI: 10.1007/978-3-030-30806-3_12, BibTeX]
  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).
    [Download, DOI: 10.4230/LIPIcs.FSTTCS.2018.9, BibTeX]
  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).
    [Download, DOI: 10.4230/LIPIcs.STACS.2018.45, BibTeX]
  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).
    [Download, DOI: 10.1007/978-3-319-58747-9_18, BibTeX]

Theses

  1. Einbettungen in das Transformationsmonoid einer vergesslichen Warteschlange
    Master's Thesis, 2016
    [Download]
  2. Analyse der Entscheidbarkeit diverser Probleme in automatischen Graphen
    Bachelor's Thesis, 2014
    [Download]

Talks

  1. Reachability Problems on Partially Lossy Queue Automata
    Highlights of Logic, Games and Automata 2019, Warsaw. [Abstract, Slides]
    13th International Symposium on Reachability Problems 2019, Brussels. [Slides]
    28. Theorietag "Automaten und Formale Sprachen" 2018, Wittenberg. [Abstract, Slides]
  2. 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. [Slides]
  3. Rational, Recognizable, and Aperiodic Sets in the Partially Lossy Queue Monoid
    Highlights of Logic, Games and Automata 2018, Berlin. [Abstract, Slides]
    35th Symposium on Theoretical Aspects of Computer Science 2018, Caen. [Slides]
    27. Theorietag "Automaten und Formale Sprachen" 2017, Bonn. [Abstract, Slides]
  4. The Transformation Monoid of a Partially Lossy Queue
    12th International Computer Science Symposium in Russia 2017, Kazan. [Slides]