The Reachability Problem for Vector Addition Systems is Not Elementary

Prelegent(ci)

Wojciech Czerwiński

Afiliacja

Uniwersytet Warszawski

Termin

31 października 2018 14:15

Pokój

p. 5050

Seminarium

Seminarium „Teoria automatów”

---

I will present a recent result about tower lower bound for reachability problem in VASes. I plan to first illustrate a few phenomena occuring in VASes by examples. Then I will show a full proof of the lower bound. This is a joint work with Sławomir Lasota, Ranko Lazic, Jerome Leroux and Filip Mazowiecki.

---