On Binary Words Being Petri Net Solvable

Kamila Barylska, Eike Best, Evgeny Erofeev, Lukasz Mikulski, Marcin Piatkowski. On Binary Words Being Petri Net Solvable. In Wil M. P. van der Aalst, Robin Bergenthum, Josep Carmona, editors, Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data, ATAED 2015, Satellite event of the conferences: 36th International Conference on Application and Theory of Petri Nets and Concurrency Petri Nets 2015 and 15th International Conference on Application of Concurrency to System Design ACSD 2015, Brussels, Belgium, June 22-23, 2015. Volume 1371 of CEUR Workshop Proceedings, pages 1-15, CEUR-WS.org, 2015. [doi]


Abstract is missing.