{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T09:45:34Z","timestamp":1648979134630},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,3,6]],"date-time":"2014-03-06T00:00:00Z","timestamp":1394064000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Informatik Spektrum"],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s00287-013-0753-5","type":"journal-article","created":{"date-parts":[[2014,3,5]],"date-time":"2014-03-05T06:56:39Z","timestamp":1394002599000},"page":"229-236","source":"Crossref","is-referenced-by-count":0,"title":["Neue, einfache Algorithmen f\u00fcr Petrinetze"],"prefix":"10.1007","volume":"37","author":[{"given":"Alain","family":"Finkel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00f4me","family":"Leroux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,3,6]]},"reference":[{"issue":"2","key":"753_CR1","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1006\/inco.1996.0053","volume":"127","author":"PA Abdulla","year":"1996","unstructured":"Abdulla PA, Jonsson B (1996) Verifying programs with unreliable channels. Inf Comput 127(2):91\u2013101","journal-title":"Inf Comput"},{"key":"753_CR2","first-page":"130","volume":"1998","author":"Z Bouziane","year":"1998","unstructured":"Bouziane Z (1998) A primitive recursive algorithm for the general petri net reachability problem. FOCS 1998:130\u2013136","journal-title":"FOCS"},{"key":"753_CR3","doi-asserted-by":"crossref","unstructured":"Bozzelli L, Ganty P (2011) Complexity analysis of the backward coverability algorithm for vass. In: Delzanno G, Potapov I (eds) Reachability Problems \u2013 5th International Workshop, RP 2011, Genoa, Italy, September 28\u201330, 2011. Proceedings, Lecture Notes in Computer Science, vol 6945, Springer, 96\u2013109","DOI":"10.1007\/978-3-642-24288-5_10"},{"key":"753_CR4","doi-asserted-by":"crossref","unstructured":"Cardoza E, Lipton RJ, Meyer AR (1976) Exponential space complete problems for Petri nets and commutative semigroups: Preliminary report. In STOC\u201976, ACM, 50\u201354","DOI":"10.1145\/800113.803630"},{"key":"753_CR5","doi-asserted-by":"crossref","unstructured":"Demri S (2010) On selective unboundedness of vass. In: Chen YF, Rezine A (eds) Proceedings 12th International Workshop on Verification of Infinite-State Systems, EPTCS, vol 39, 1\u201315","DOI":"10.4204\/EPTCS.39.1"},{"key":"753_CR6","doi-asserted-by":"crossref","unstructured":"Figueira D, Figueira S, Schmitz S, Schnoebelen P (2011) Ackermannian and primitive-recursive bounds with dickson\u2019s lemma. In: Logic in Computer Science (LICS), 26th Annual IEEE Symposium, 269\u2013278","DOI":"10.1109\/LICS.2011.39"},{"key":"753_CR7","doi-asserted-by":"crossref","unstructured":"Finkel A (1993) The minimal coverability graph for petri nets. In: Rozenberg G (ed) Advances in Petri Nets 1993. Lect Notes Comp Sci, vol 674, Springer, 210\u2013243","DOI":"10.1007\/3-540-56689-9_45"},{"key":"753_CR8","doi-asserted-by":"crossref","unstructured":"Finkel A, Schnoebelen Ph (2001) Well-structured transition systems everywhere! Theoret Comput Sci 256:63\u201392","DOI":"10.1016\/S0304-3975(00)00102-X"},{"key":"753_CR9","unstructured":"Finkel A, Goubault-Larrecq J (2009) Forward analysis for WSTS, Part I: Completions. In: Albers S, Marion JY (eds) 26th Symp on Theoretical Aspects of Computer Science, STACS\u201909, Springer, 433\u2013444"},{"key":"753_CR10","doi-asserted-by":"crossref","unstructured":"Finkel A, Goubault-Larrecq J (2009) Forward analysis for WSTS, Part II: Complete WSTS. In: Albers S, Marchetti-Spaccamela A, Matias Y, Nikoletseas SE, Thomas W (eds) 36th Int. Colloquium on Automata, Languages and Programming, ICALP\u201909. Lect. Notes Comp Sci, vol 5556, Springer, 188\u2013199","DOI":"10.1007\/978-3-642-02930-1_16"},{"key":"753_CR11","doi-asserted-by":"crossref","unstructured":"Hopcroft JE, Pansiot JJ (1979) On the reachability problem for 5-dimensional vector addition systems. Theor Comput Sci 8:135\u2013159","DOI":"10.1016\/0304-3975(79)90041-0"},{"key":"753_CR12","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 (2008) Bouziane\u2019s transformation of the petri net reachability problem and incorrectness of the related algorithm. Inf Comput 206:1259\u20131263","journal-title":"Inf Comput"},{"key":"753_CR13","doi-asserted-by":"crossref","unstructured":"Leroux J (2012) 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. EPiC Series, vol 10, EasyChair, 214\u2013228","DOI":"10.2168\/LMCS-9(1:5)2013"},{"issue":"3","key":"753_CR14","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1145\/322261.322271","volume":"28","author":"EW Mayr","year":"1981","unstructured":"Mayr EW, Meyer AR (1981) The complexity of the finite containment problem for petri nets. J ACM 28(3):561\u2013576","journal-title":"J ACM"},{"key":"753_CR15","unstructured":"Pachl JK (2003) Reachability problems for communicating finite state machines. CoRR cs.LO\/0306121"},{"issue":"2","key":"753_CR16","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(78)90036-1","volume":"6","author":"C Rackoff","year":"1978","unstructured":"Rackoff C (1978) The covering and boundedness problems for vector addition systems. Theoret Comput Sci 6(2):223\u2013231","journal-title":"Theoret Comput Sci"},{"key":"753_CR17","unstructured":"Schnoebelen Ph (2010) Lossy counter machines decidability cheat sheet. In: Kucera A, Potapov I (eds) Proceedings of the 4th Workshop on Reachability Problems in Computational Models (RP\u201910). Volume 6227 of Lecture Notes in Computer Science, Brno, Czech Republic, Springer, 51\u201375"}],"container-title":["Informatik-Spektrum"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00287-013-0753-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00287-013-0753-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00287-013-0753-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T04:55:33Z","timestamp":1565240133000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00287-013-0753-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,6]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["753"],"URL":"https:\/\/doi.org\/10.1007\/s00287-013-0753-5","relation":{},"ISSN":["0170-6012","1432-122X"],"issn-type":[{"value":"0170-6012","type":"print"},{"value":"1432-122X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,6]]}}}