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]
@inproceedings{Kungas05, title = {Petri Net Reachability Checking Is Polynomial with Optimal Abstraction Hierarchies}, author = {Peep Küngas}, year = {2005}, doi = {10.1007/11527862_11}, url = {http://dx.doi.org/10.1007/11527862_11}, tags = {abstraction}, researchr = {https://researchr.org/publication/Kungas05}, cites = {0}, citedby = {0}, pages = {149-164}, booktitle = {Abstraction, Reformulation and Approximation, 6th International Symposium, SARA 2005, Airth Castle, Scotland, UK, July 26-29, 2005, Proceedings}, editor = {Jean-Daniel Zucker and Lorenza Saitta}, volume = {3607}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-27872-9}, }