Joint work with Utkarsh Gupta, Preey Shah, S. Akshay

Speaker(s)

Piotr Hofman

Affiliation

Uniwersytet Warszawski

Date

Dec. 12, 2018, 2:15 p.m.

Room

room 5050

Title in Polish

Continuous Reachability for Unordered Data Petri Nets

Seminar

Seminar Automata Theory

---

What is the best way to reduce complexity? The simple answer is "change the problem". Considering the hardness of Petri net reachability people developed a different notion, namely continuous reachability. During the talk, I will explain it and show how it can be solved. Next, we will go to the extensions of Petri Nets and look if the continuous reachability can be lifted to them.

In particular, we will look to Petri Nets with resets and to Unordered Data Petri Nets. The first, half of the talk will be based on works of Haddad, Fraca, Blondin, and Haase. Second is based on our current submission to FoSSaCS.

---