Abstract
The second Dagstuhl seminar on coalgebraic logics took place from October 7–12, 2012, in the Leibniz Forschungszentrum Schloss Dagstuhl, following a successful earlier one in December 2009. From the 44 researchers who attended and the 30 talks presented, this collection highlights some of the progress that has been made in the field. We are grateful to Giuseppe Longo and his interest in a special issue in Mathematical Structures in Computer Science.
Highlights
The second Dagstuhl seminar on coalgebraic logics took place from October 7–12, 2012, in the Leibniz Forschungszentrum Schloss Dagstuhl, following a successful earlier one in December 2009
An important role is played by final coalgebras which can be understood as the quotient by bisimilarity of the disjoint union of all coalgebras
Final coalgebras play an important role in program semantics, both because they model infinite data types such as streams and because they provide domains for solving recursive equations
Summary
The second Dagstuhl seminar on coalgebraic logics took place from October 7–12, 2012, in the Leibniz Forschungszentrum Schloss Dagstuhl, following a successful earlier one in December 2009. Coalgebras generalise important structures such as automata, transition systems, Kripke structures, Markov chains and many more. For each of the different types of coalgebra, there is a notion of behavioural equivalence or bisimilarity identifying states that cannot be observationally distinguished.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
