Peep Küngas. Petri Net Reachability Checking Is Polynomial with Optimal Abstraction Hierarchies. In Jean-Daniel Zucker, Lorenza Saitta, editors, Abstraction, Reformulation and Approximation, 6th International Symposium, SARA 2005, Airth Castle, Scotland, UK, July 26-29, 2005, Proceedings. Volume 3607 of Lecture Notes in Computer Science, pages 149-164, Springer, 2005. [doi]
Abstract is missing.