Henning Kerstan

This website requires JavaScript. Please enable JavaScript for this website.

Publications

2018

Coalgebraic Behavioral Metrics

Paolo Baldan • Filippo Bonchi • Henning Kerstan • Barbara König

We study different behavioral metrics, such as those arising from both branching and linear-time semantics, in a coalgebraic setting.

Logical Methods in Computer Science. 14 (3). 2018.

2016

Connected car report 2016 – Opportunities, risk, and turmoil on the road to autonomous vehicles

Richard Viereckl • Dietmar Ahlemann • Alex Koster • Evan Hirsh • Felix Kuhnert • Joachim Mohs • Marco Fischer • Walter Gerling • Kaushik Gnanasekaran • Julia Kusber • Juliane Stephan • David Crusius • Henning Kerstan • Trent Warnke • Manuel Schulte • Jonas Seyfferth • Edward H. Baker

In Connected car report 2016. . Editor(s): Richard Viereckl, Alex Koster, Evan Hirsh, Dietmar Ahlemann. PwC Strategy&. 2016.

Coalgebraic Behavior Analysis – From Qualitative to Quantitative Analyses

Henning Kerstan

This thesis investigates how to improve and build upon existing results to explore the expressive power of category theory and in particular coalgebra in behavioral analysis

PhD thesis. Universität Duisburg-Essen. 2016.

2015

Towards Trace Metrics via Functor Lifting

Paolo Baldan • Filippo Bonchi • Henning Kerstan • Barbara König

We investigate the possibility of deriving metric trace semantics in a coalgebraic framework.

In 6th Conference on Algebra and Coalgebra in Computer Science (CALCO’15). Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. 2015.

2014

Behavioral Metrics via Functor Lifting

Paolo Baldan • Filippo Bonchi • Henning Kerstan • Barbara König

We study behavioral metrics in an abstract coalgebraic setting.

In 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014). Volume 29 of Leibniz International Proceedings in Informatics (LIPIcs). Editor(s): Venkatesh Raman, S. P. Suresh. Schloss Dagstuhl – Leibniz-Zentrum für Informatik. 2014.

Lifting Adjunctions to Coalgebras to (Re-)Discover Automata Constructions

Henning Kerstan • Barbara König • Bram Westerbaan

We identify several automata constructions (like the powerset determinization construction) as adjunctions between categories of coalgebras. They arise by lifting other, well-known adjunctions.

In Coalgebraic Methods in Computer Science. Volume 8446 of Lecture Notes in Computer Science. Editor(s): Marcello M. Bonsangue. Springer, Berlin, Heidelberg. 2014.

2013

Coalgebraic Trace Semantics for Continuous Probabilistic Transition Systems

Henning Kerstan • Barbara König

Coalgebras in a Kleisli category yield a generic definition of trace semantics for various types of labelled transition systems. In this paper we apply this generic theory to generative probabilistic transition systems, short PTS, with arbitrary (possibly uncountable) state spaces

Logical Methods in Computer Science. 9 [4:16] (834). 2013.

2012

Coalgebraic Trace Semantics for Probabilistic Transition Systems Based on Measure Theory

Henning Kerstan • Barbara König

We look at finite and infinite traces for generative probabilistic transition systems in a coalgebraic framework.

Technical report. Abteilung für Informatik und Angewandte Kognitionswissenschaft, Universität Duisburg-Essen. 2012.

Coalgebraic Trace Semantics for Probabilistic Transition Systems Based on Measure Theory

Henning Kerstan • Barbara König

We look at finite and infinite traces for generative probabilistic transition systems in a coalgebraic framework.

In CONCUR 2012 – Concurrency Theory. Volume 7454 of Lecture Notes in Computer Science. Editor(s): Maciej Koutny, Irek Ulidowski. Springer, Berlin Heidelberg. 2012.

2011

Trace Semantics for Probabilistic Transition Systems – A Coalgebraic Approach

Henning Kerstan

Diplomarbeit (final thesis in the German diploma degree; equivalent to a master's thesis). Universität Duisburg-Essen. 2011.