Continuous Reachability for Unordered Data Petri Nets is in PTime

Utkarsh Gupta, Preey Shah, S. Akshay, Piotr Hofman. Continuous Reachability for Unordered Data Petri Nets is in PTime. In Mikolaj Bojanczyk, Alex Simpson, editors, Foundations of Software Science and Computation Structures - 22nd International Conference, FOSSACS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings. Volume 11425 of Lecture Notes in Computer Science, pages 260-276, Springer, 2019. [doi]

Abstract

Abstract is missing.