{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T22:30:57Z","timestamp":1783549857826,"version":"3.55.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T00:00:00Z","timestamp":1404518400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Softw Syst Model"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1007\/s10270-014-0426-0","type":"journal-article","created":{"date-parts":[[2014,7,4]],"date-time":"2014-07-04T04:14:24Z","timestamp":1404447264000},"page":"719-725","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Recent and simple algorithms for Petri nets"],"prefix":"10.1007","volume":"14","author":[{"given":"Alain","family":"Finkel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J\u00e9r\u00f4me","family":"Leroux","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,7,5]]},"reference":[{"key":"426_CR1","doi-asserted-by":"crossref","unstructured":"Bouziane, Z.: A primitive recursive algorithm for the general petri net reachability problem. In: FOCS 1998, pp. 130\u2013136 (1998)","DOI":"10.1109\/SFCS.1998.743436"},{"key":"426_CR2","doi-asserted-by":"crossref","unstructured":"Bozzelli, L., Ganty, P.: Complexity analysis of the backward coverability algorithm for vass. In: Delzanno, G., Potapov, I. (eds.) Reachability Problems\u20145th International Workshop, RP 2011, Genoa, Italy, September 28\u201330, 2011. Proceedings. Volume 6945 of Lecture Notes in Computer Science, pp. 96\u2013109. Springer (2011)","DOI":"10.1007\/978-3-642-24288-5_10"},{"key":"426_CR3","doi-asserted-by":"crossref","unstructured":"Cardoza, E., Lipton, R.J., Meyer, A.R.: Exponential space complete problems for Petri nets and commutative semigroups: preliminary report. In: STOC\u201976, pp. 50\u201354. ACM (1976)","DOI":"10.1145\/800113.803630"},{"key":"426_CR4","doi-asserted-by":"crossref","unstructured":"Demri, S.: On selective unboundedness of vass. In: Chen, Y.F., Rezine, A. (eds.) Proceedings 12th International Workshop on Verification of Infinite-State Systems. Volume 39 of EPTCS, pp. 1\u201315 (2010)","DOI":"10.4204\/EPTCS.39.1"},{"key":"426_CR5","unstructured":"Figueira, D., Figueira, S., Schmitz, S., Schnoebelen, P.: Ackermannian and primitive-recursive bounds with Dickson\u2019s lemma. In: Logic in Computer Science (LICS), 2011 26th Annual IEEE Symposium on, pp. 269\u2013278 (2011)"},{"issue":"1\u20132","key":"426_CR6","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, Ph: Well-structured transition systems everywhere!. Theoret. Comput. Sci. 256(1\u20132), 63\u201392 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"426_CR7","doi-asserted-by":"crossref","unstructured":"Finkel, A.: The minimal coverability graph for petri nets. In: Rozenberg, G. (ed.) Advances in Petri Nets 1993. Volume 674 of Lect. Notes Comp. Sci. pp. 210\u2013243. Springer (1993)","DOI":"10.1007\/3-540-56689-9_45"},{"key":"426_CR8","unstructured":"Finkel, A., Goubault-Larrecq, J.: Forward analysis for WSTS, part I: completions. In: Albers, S., Marion, J.Y. (eds.) 26th Symposium on Theoretical Aspects of Computer Science, STACS\u201909, pp. 433\u2013444. Springer (2009)"},{"key":"426_CR9","doi-asserted-by":"crossref","unstructured":"Finkel, A., Goubault-Larrecq, J.: Forward analysis for WSTS, part II: complete WSTS. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S.E., Thomas, W. (eds.) 36th International Colloquium on Automata, Languages and Programming, ICALP\u201909. Volume 5556 of Lecture Notes Computer Science, pp. 188\u2013199. Springer (2009)","DOI":"10.1007\/978-3-642-02930-1_16"},{"key":"426_CR10","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0304-3975(79)90041-0","volume":"8","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Pansiot, J.J.: On the reachability problem for 5-dimensional vector addition systems. Theor. Comput. Sci. 8, 135\u2013159 (1979)","journal-title":"Theor. Comput. Sci."},{"key":"426_CR11","doi-asserted-by":"crossref","first-page":"1259","DOI":"10.1016\/j.ic.2008.06.003","volume":"206","author":"P Jan\u010dar","year":"2008","unstructured":"Jan\u010dar, P.: Bouziane\u2019s transformation of the petri net reachability problem and incorrectness of the related algorithm. Inf. Comput. 206, 1259\u20131263 (2008)","journal-title":"Inf. Comput."},{"key":"426_CR12","unstructured":"Leroux, J.: Vector addition systems reachability problem (a simpler solution). In: Voronkov, A. (ed.) The Alan Turing Centenary Conference, Turing-100, Manchester UK June 22\u201325, 2012, Proceedings. Volume 10 of EPiC Series, EasyChair, pp. 214\u2013228 (2012)"},{"issue":"3","key":"426_CR13","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1145\/322261.322271","volume":"28","author":"EW Mayr","year":"1981","unstructured":"Mayr, E.W., Meyer, A.R.: The complexity of the finite containment problem for petri nets. J. ACM 28(3), 561\u2013576 (1981)","journal-title":"J. ACM"},{"key":"426_CR14","unstructured":"Pachl, J.K.: Reachability problems for communicating finite state machines. CoRR cs.LO\/0306121 (2003)"},{"issue":"2","key":"426_CR15","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(78)90036-1","volume":"6","author":"Ch Rackoff","year":"1978","unstructured":"Rackoff, Ch.: The covering and boundedness problems for vector addition systems. Theoret. Comput. Sci. 6(2), 223\u2013231 (1978)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Software & Systems Modeling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10270-014-0426-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10270-014-0426-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10270-014-0426-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T11:35:58Z","timestamp":1565609758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10270-014-0426-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,5]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["426"],"URL":"https:\/\/doi.org\/10.1007\/s10270-014-0426-0","relation":{},"ISSN":["1619-1366","1619-1374"],"issn-type":[{"value":"1619-1366","type":"print"},{"value":"1619-1374","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,5]]}}}