**Date: **
17:00,
Thursday, November 9, 2017

**Speaker: **
Piotrek Hofman

**Venue: **IST Austria

**Notes: **

Mondi 3

Data nets are yet another extension of Petri Nets in which the relations between consumed and produced tokens are very restricted. Their subclasses like, Unordered Data Petri Nets (UDPN), from the theory perspective are natural and easy to define. Furthermore, similarly

to Petri Nets they have a lot of structure to explore. During the talk, we will start form defining Data Nets and formulating the state equation, a generalization of one of the simplest and most important equations for Petri Nets.

Next, I will present a sketch of the proof of the correctness of the NP-time algorithm, to solve the equation in case of Unordered Data Petri Nets. Finally, I will mention some novel results for other classes of Data Nets and open problems that we are working on.

The talk will base on a joint work with Patrick Totzke and Jerome Leroux

“Linear Combinations of Unordered Data Vectors” published at LICS-2017

and on unpublished results with Sławomir Lasota.