BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260921T003300Z
UID:Seminar-verification-655@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Patrick Totzke:MAILTO:totzke@liverpool.ac.uk
DTSTART:20171026T140000
DTEND:20171026T150000
SUMMARY:Verification Series
DESCRIPTION:Alexei Lisitsa: Revisiting MU-puzzle. A case study in finite countermodels verification\n\nIn this talk  we will  consider well-known MU puzzle from Goedel, Escher, Bach: An Eternal Golden Braid book (GEB) by D. Hofstadter, as an infinite state safety verification problem. We demonstrate fully automated solution (for the first time?)  using finite countermodels method (FCM). \nWe highlight advantages of FCM  and compare it with common alternatives. \n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=655
LOCATION:
END:VEVENT
END:VCALENDAR