2017-02-16: Clemens Kupke (MSP)

Sat, 21 Oct 2023 21:24:08 +0100

Clemens Kupke (MSP)

MSP 101: Automata on infinite words

Abstract

In this 101 I plan to discuss omega-automata, i.e., finite automata that operate on infinite words/streams. These automata form an important tool for the specification and verification of the ongoing, possibly infinite behaviour of a system. In my talk I will provide the standard definition(s) of omega-automata and highlight what makes omega-automata difficult from a coalgebraic perspective. Finally, I am going to discuss the work by Ciancia & Venema that provides a first coalgebraic representation of a particular type of omega-automata, so-called Muller automata.

2017-02-16 14:00:00 UTC
LT1310