Pierre-Alain Reynier, Frédéric Servais. Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning. In Lars M. Kristensen, Laure Petrucci, editors, Applications and Theory of Petri Nets - 32nd International Conference, PETRI NETS 2011, Newcastle, UK, June 20-24, 2011. Proceedings. Volume 6709 of Lecture Notes in Computer Science, pages 69-88, Springer, 2011. [doi]
@inproceedings{ReynierS11,
title = {Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning},
author = {Pierre-Alain Reynier and Frédéric Servais},
year = {2011},
doi = {10.1007/978-3-642-21834-7_5},
url = {http://dx.doi.org/10.1007/978-3-642-21834-7_5},
researchr = {https://researchr.org/publication/ReynierS11},
cites = {0},
citedby = {0},
pages = {69-88},
booktitle = {Applications and Theory of Petri Nets - 32nd International Conference, PETRI NETS 2011, Newcastle, UK, June 20-24, 2011. Proceedings},
editor = {Lars M. Kristensen and Laure Petrucci},
volume = {6709},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-21833-0},
}