選出版物

• C Kissig, Y Venema, "Complementation of Coalgebra Automata", CALCO 2009年
  [PDF] [Bibtex] [Video]
• C Kissig, "Decidability of S2S" (Master of Logic Dissertation), 2007年, ILLC MoL Series,
  [PDF] [Bibtex] [Abstract, TXT]

This is a work-in-progress list of the presentations I gave, in chronological order. If I have prepared slides, you likely find them here.

Note that most of these talks are workshop or seminar contributions, and then quite conceptual. Should you have spotted a mistake, have an opinion or question about any of these talks, or would like me to visit your institute to present on my research, please let me know: email(at)christiankissig.de .

Trace theory is concerned with assigning transition systems a semantics in trace monoids. Informally, trace monoids are word monoids generated from an independence relation, analogous to parallelism in concurrency. Generic trace theory seeks to extends trace theory to arbitrary transition systems, that formally are Set-based coalgebras.

Coalgebra automata were invented by Yde Venema and first published on in his paper "Automata and Fixed Point Logics: A Coalgebraic Approach". Their purpose is two-fold. On the one hand, coalgebra automata provide a suitable means to study properties of automata for a large class of input types, comprising words, trees, and graphs. On the other hand coalgebra automata introduce fixed point operators in Moss' coalgebraic logic. The latter reflects the insight that states in coalgebra automata correspond to formulae of (some) coalgebraic logic, in the sense that an automaton accepts a point in a coalgebra iff that point satisfies the corresponding formula. This correspondence has been exploited in the case of trees by Michael Rabin in his decidability result for monadic second-order logic for binary trees (S2S).

This page is under construction. Please notify me ( email(at)christiankissig.de ) of any developments I have been missing.