%0 Conference Paper %1 conf/rp/BozzelliG11 %A Bozzelli, Laura %A Ganty, Pierre %B RP %D 2011 %E Delzanno, Giorgio %E Potapov, Igor %I Springer %K PetriNets %P 96-109 %R 10.1007/978-3-642-24288-5_10 %T Complexity Analysis of the Backward Coverability Algorithm for VASS. %V 6945 %X By using the known lower and upper complexity bounds of the coverability problem for vass, we characterize the complexity of the classical backward algorithm for vass coverability, and provide optimal bounds on the size of the symbolic representation it computes. %@ 978-3-642-24287-8

@inproceedings{conf/rp/BozzelliG11, abstract = {By using the known lower and upper complexity bounds of the coverability problem for vass, we characterize the complexity of the classical backward algorithm for vass coverability, and provide optimal bounds on the size of the symbolic representation it computes.}, added-at = {2018-10-16T17:43:58.000+0200}, author = {Bozzelli, Laura and Ganty, Pierre}, biburl = {https://www.bibsonomy.org/bibtex/291a27000d3ec11a1d66ab733ce5ac17d/paves_intern}, booktitle = {RP}, crossref = {conf/rp/2011}, doi = {10.1007/978-3-642-24288-5_10}, editor = {Delzanno, Giorgio and Potapov, Igor}, ee = {http://dx.doi.org/10.1007/978-3-642-24288-5_10}, interhash = {cf9d9ce0241a479c734394b5f8d9bbfb}, intrahash = {91a27000d3ec11a1d66ab733ce5ac17d}, isbn = {978-3-642-24287-8}, keywords = {PetriNets}, pages = {96-109}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-02-08T20:00:02.000+0100}, title = {Complexity Analysis of the Backward Coverability Algorithm for VASS.}, volume = 6945, year = 2011 }