Workshop on Automata and Coalgebra.
Helle Hansen (Delft University of Technology) and Alexandra Silva (Radboud University Nijmegen).
||Break / Discussion
Automata and coalgebra are closely related in at least two ways.
On the one hand, automata are the archetypical examples of systems that can be modelled as coalgebras. These include deterministic, nondeterministic, weighted, probabilistic, and push-down automata that run on finite words, as well as Muller automata that run on infinite words, various types of transducers, and Turing machines. Coalgebra has provided a unifying perspective on these different types of automata, as well as algorithms and coinductive methods for specifying and constructing such automata, and reasoning about their semantics.
On the other hand, automata that run on coalgebras generalise automata that run on infinite words and the latter’s close relationship with modal fixpoint logics. As such, they are a valuable tool in understanding the expressiveness of and obtaining decision procedures for coalgebraic fixpoint logics.
In this workshop, four leading researchers in the area of coalgebra and automata will give invited talks. The aim is to discuss current research on automata and coalgebra, and lay some ideas for the future.