LSV Seminar

The LSV seminar takes place on Tuesday at 11:00 AM. The usual location is the conference room at Pavillon des Jardins (venue). If you wish to be informed by e-mail about upcoming seminars, please contact Stéphane Le Roux and Matthias Fuegger.

The seminar is open to public and does not require any form of registration.

Past Seminars

The Reachability Problem for Petri Nets is Not Elementary

Visit website for this news | Export event in iCalendar format

 Filip Mazowiecki
Monday, October 08 2018 at 11:00AM
Amphi Chemla
Filip Mazowiecki (University of Bordeaux)

Petri nets, also known as vector addition systems, are a long established and widely used model of concurrent processes. The complexity of their reachability problem is one of the most prominent open questions in the theory of verification. That the reachability problem is decidable was established by Mayr in his seminal STOC 1981 work, and the currently best upper bound is non-primitive recursive cubic-Ackermannian of Leroux and Schmitz from LICS 2015. We show that the reachability problem is not elementary. Until this work, the best lower bound has been exponential space, due to Lipton in 1976.

For the full text see:

About LSV


Export agenda in iCalendar format | Past seminars

Tue, Feb 19

Past seminars