WQO dichotomy conjecture — proof of a special case

Speaker(s)

Radosław Piórkowski

Affiliation

Uniwersytet Warszawski

Date

Oct. 25, 2017, 2:15 p.m.

Room

room 5050

Seminar

Seminar Automata Theory

---

Decidability of many standard decision problems for Petri nets becomes an open problem once we extend the model with data.
If we restrict only to homogeneous data domains, according to the WQO Dichotomy Conjecture
there exists a simple criterion for decidability. I will sketch the proof of this conjecture for data being 2-edge-colored homogeneous graphs.

---