@inproceedings{10.1145/3373718.3394732,
    Address = {New York, NY, USA},
    Author = {Leroux, J\'{e}r\^{o}me},
    BookTitle = {Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science},
    ISBN = {9781450371049},
    Keywords = {verification, Ackermannian complexity, Petri nets, vector addition systems, Grzegorczyk Hierarchy, reachability problem},
    Location = {Saarbr\"{u}cken, Germany},
    Pages = {1--6},
    Publisher = {Association for Computing Machinery},
    Series = {LICS '20},
    Title = {When Reachability Meets Grzegorczyk},
    URL = {https://doi.org/10.1145/3373718.3394732},
    Year = {2020},
    bdsk-url-1 = {https://doi.org/10.1145/3373718.3394732},
    date-added = {2020-05-30 18:54:54 +0200},
    date-modified = {2020-05-30 18:54:54 +0200},
    numpages = {6},
    doi = {10.1145/3373718.3394732}
}

@inproceedings{10.1145/3373718.3394732, Address = {New York, NY, USA}, Author = {Leroux, J\'{e}r\^{o}me}, BookTitle = {Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science}, ISBN = {9781450371049}, Keywords = {verification, Ackermannian complexity, Petri nets, vector addition systems, Grzegorczyk Hierarchy, reachability problem}, Location = {Saarbr\"{u}cken, Germany}, Pages = {1--6}, Publisher = {Association for Computing Machinery}, Series = {LICS '20}, Title = {When Reachability Meets Grzegorczyk}, URL = {https://doi.org/10.1145/3373718.3394732}, Year = {2020}, bdsk-url-1 = {https://doi.org/10.1145/3373718.3394732}, date-added = {2020-05-30 18:54:54 +0200}, date-modified = {2020-05-30 18:54:54 +0200}, numpages = {6}, doi = {10.1145/3373718.3394732} }