BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260416T085919Z
UID:Seminar-verification-679@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Patrick Totzke:MAILTO:totzke@liverpool.ac.uk
DTSTART:20190221T130000
DTEND:20190221T140000
SUMMARY:Verification Series
DESCRIPTION:Karoliina Lehtinen: Parity, Büchi, Weak\n\nThis talk is about the trade-offs between different acceptance conditions for omega-word automata.\n\nI present recent improvements that bring the blow-up up incurred during the translation of alternating parity automata into Büchi and weak automata into line with the current algorithms solving parity games. I will finish by discussing the gap between the upper and lower bounds for this problem, and what it tells us about where to go next.\n\nThe technical part of this talk is based on currently unpublished work with Laure Daviaud and Marcin Jurdzi?ski on quasi-polynomially sized Büchi automata that use universal trees to recognise winning strategies in infinite parity games of fixed width.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=679
LOCATION:
END:VEVENT
END:VCALENDAR