BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260624T003408Z
UID:Seminar-verification-685@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Patrick Totzke:MAILTO:totzke@liverpool.ac.uk
DTSTART:20190611T110000
DTEND:20190611T120000
SUMMARY:Verification Series
DESCRIPTION:Patrick Totzke: VASS Reachability: What's new and why do I care?\n\nI will talk about the reachability problem for vector addition systems, a.k.a. Petri Nets.\nWhile its decidability is considered to be one of the great achievements in theoretical computer science, the massive gap in our knowledge concerning its complexity is a major embarrassment.\n\nI will motivate the model and the relevance of the problem, recall its history and present the status quo.\nIf time permits I'll present some ideas from our LICS'16 paper that fixes the complexity in dimension 2.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=685
LOCATION:
END:VEVENT
END:VCALENDAR