%0 Conference Paper %1 conf/apn/ReynierS11 %A Reynier, Pierre-Alain %A Servais, Frédéric %B Petri Nets %D 2011 %E Kristensen, Lars Michael %E Petrucci, Laure %I Springer %K dblp %P 69-88 %T Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning. %U http://dblp.uni-trier.de/db/conf/apn/pn2011.html#ReynierS11 %V 6709 %@ 978-3-642-21833-0

@inproceedings{conf/apn/ReynierS11, added-at = {2017-05-26T00:00:00.000+0200}, author = {Reynier, Pierre-Alain and Servais, Frédéric}, biburl = {https://www.bibsonomy.org/bibtex/28f92c4db115e2ec01d0d26952bb94506/dblp}, booktitle = {Petri Nets}, crossref = {conf/apn/2011}, editor = {Kristensen, Lars Michael and Petrucci, Laure}, ee = {https://doi.org/10.1007/978-3-642-21834-7_5}, interhash = {bd760c0e3a7e622f9185399117bf4c0b}, intrahash = {8f92c4db115e2ec01d0d26952bb94506}, isbn = {978-3-642-21833-0}, keywords = {dblp}, pages = {69-88}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T15:59:13.000+0200}, title = {Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning.}, url = {http://dblp.uni-trier.de/db/conf/apn/pn2011.html#ReynierS11}, volume = 6709, year = 2011 }