{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,25]],"date-time":"2026-09-25T18:25:51Z","timestamp":1790360751804,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T00:00:00Z","timestamp":1467676800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/M011801\/1"],"award-info":[{"award-number":["EP\/M011801\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-14-CE28-0005"],"award-info":[{"award-number":["ANR-14-CE28-0005"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000275","name":"Leverhulme Trust","doi-asserted-by":"publisher","award":["VP1-2014-041"],"award-info":[{"award-number":["VP1-2014-041"]}],"id":[{"id":"10.13039\/501100000275","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,5]]},"DOI":"10.1145\/2933575.2933593","type":"proceedings-article","created":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T09:34:47Z","timestamp":1476437687000},"page":"467-476","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["The Complexity of Coverability in \u03bd-Petri Nets"],"prefix":"10.1145","author":[{"given":"Ranko","family":"Lazi\u0107","sequence":"first","affiliation":[{"name":"DIMAP, Department of Computer Science, University of Warwick, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sylvain","family":"Schmitz","sequence":"additional","affiliation":[{"name":"LSV, ENS Cachan & CNRS & Inria, Universit\u00e9 Paris-Saclay, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2016,7,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1999.2843"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43951-7_2"},{"key":"e_1_3_2_1_3_1","first-page":"189","volume-title":"Coll. Math. Soc. J\u00e1nos Bolyai","author":"Bonnet R.","year":"1975","unstructured":"R. Bonnet . On the cardinality of the set of initial intervals of a partially ordered set. In Infinite and finite sets, Vol. 1 , Coll. Math. Soc. J\u00e1nos Bolyai , pages 189 -- 198 . North-Holland , 1975 . R. Bonnet. On the cardinality of the set of initial intervals of a partially ordered set. In Infinite and finite sets, Vol. 1, Coll. Math. Soc. J\u00e1nos Bolyai, pages 189--198. North-Holland, 1975."},{"key":"e_1_3_2_1_4_1","series-title":"LNCS","first-page":"96","volume-title":"Proc. RP","author":"Bozzelli L.","year":"2011","unstructured":"L. Bozzelli and P. Ganty . Complexity analysis of the backward coverability algorithm for VASS . In Proc. RP 2011 , volume 6945 of LNCS , pages 96 -- 109 . Springer , 2011. L. Bozzelli and P. Ganty. Complexity analysis of the backward coverability algorithm for VASS. In Proc. RP 2011, volume 6945 of LNCS, pages 96--109. Springer, 2011."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2008.47"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00009-1"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49630-5_16"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2011.39"},{"key":"e_1_3_2_1_9_1","first-page":"433","volume-title":"Proc. STACS 2009","volume":"3","author":"Finkel A.","year":"2009","unstructured":"A. Finkel and J. Goubault-Larrecq . Forward analysis for WSTS, part I: Completions . In Proc. STACS 2009 , volume 3 of LIPIcs, pages 433 -- 444 . LZI, 2009 . A. Finkel and J. Goubault-Larrecq. Forward analysis for WSTS, part I: Completions. In Proc. STACS 2009, volume 3 of LIPIcs, pages 433--444. LZI, 2009."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00102-X"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2004.01.005"},{"key":"e_1_3_2_1_12_1","volume-title":"The ideal approach to computing closed subsets in well-quasi-orderings. In preparation","author":"Goubault-Larrecq J.","year":"2016","unstructured":"J. Goubault-Larrecq , P. Karandikar , K. Narayan Kumar , and Ph. Schnoebelen . The ideal approach to computing closed subsets in well-quasi-orderings. In preparation , 2016 . J. Goubault-Larrecq, P. Karandikar, K. Narayan Kumar, and Ph. Schnoebelen. The ideal approach to computing closed subsets in well-quasi-orderings. In preparation, 2016."},{"key":"e_1_3_2_1_13_1","volume-title":"Comput. Sci., 10(4:4):1--39","author":"Haase C.","year":"2014","unstructured":"C. Haase , S. Schmitz , and Ph. Schnoebelen . The power of priority channel systems. Logic. Meth . in Comput. Sci., 10(4:4):1--39 , 2014 . C. Haase, S. Schmitz, and Ph. Schnoebelen. The power of priority channel systems. Logic. Meth. in Comput. Sci., 10(4:4):1--39, 2014."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2012.46"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-2.1.326"},{"key":"e_1_3_2_1_16_1","series-title":"LNCS","first-page":"1","volume-title":"Proc. RP","author":"Lazi\u0107 R.","year":"2015","unstructured":"R. Lazi\u0107 and S. Schmitz . The ideal view on Rackoff's coverability technique . In Proc. RP 2015 , volume 9328 of LNCS , pages 1 -- 13 . Springer , 2015. R. Lazi\u0107 and S. Schmitz. The ideal view on Rackoff's coverability technique. In Proc. RP 2015, volume 9328 of LNCS, pages 1--13. Springer, 2015."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1497079.1497082"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2874774"},{"key":"e_1_3_2_1_20_1","first-page":"477","volume-title":"Proc. IFIP TCS 2008","volume":"273","author":"Meyer R.","year":"2008","unstructured":"R. Meyer . On boundedness in depth in the π-calculus . In Proc. IFIP TCS 2008 , volume 273 of IFIP AICT, pages 477 -- 489 . Springer , 2008 . R. Meyer. On boundedness in depth in the π-calculus. In Proc. IFIP TCS 2008, volume 273 of IFIP AICT, pages 477--489. Springer, 2008."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00165-016-0370-6"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(78)90036-1"},{"issue":"3","key":"e_1_3_2_1_24_1","first-page":"329","article-title":"Name creation vs. replication in Petri net systems","volume":"88","author":"Rosa-Velardo F.","year":"2008","unstructured":"F. Rosa-Velardo and D. de Frutos-Escrig . Name creation vs. replication in Petri net systems . Fund. Inform. , 88 ( 3 ): 329 -- 356 , 2008 . F. Rosa-Velardo and D. de Frutos-Escrig. Name creation vs. replication in Petri net systems. Fund. Inform., 88(3):329--356, 2008.","journal-title":"Fund. Inform."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.05.007"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2012.03.004"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2858784"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/2027223.2027268"},{"key":"e_1_3_2_1_29_1","volume-title":"Algorithmic aspects of WQO theory. Lecture notes","author":"Schmitz S.","year":"2012","unstructured":"S. Schmitz and Ph. Schnoebelen . Algorithmic aspects of WQO theory. Lecture notes , 2012 . URL http:\/\/cel.archives-ouvertes.fr\/cel-00727025. S. Schmitz and Ph. Schnoebelen. Algorithmic aspects of WQO theory. Lecture notes, 2012. URL http:\/\/cel.archives-ouvertes.fr\/cel-00727025."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40184-8_2"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/1885577.1885631"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01973619"}],"event":{"name":"LICS '16: 31st Annual ACM\/IEEE Symposium on Logic in Computer Science","location":"New York NY USA","acronym":"LICS '16","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society"]},"container-title":["Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933575.2933593","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2933575.2933593","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:56:03Z","timestamp":1750208163000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933575.2933593"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,5]]},"references-count":30,"alternative-id":["10.1145\/2933575.2933593","10.1145\/2933575"],"URL":"https:\/\/doi.org\/10.1145\/2933575.2933593","relation":{},"subject":[],"published":{"date-parts":[[2016,7,5]]},"assertion":[{"value":"2016-07-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}