{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:07:17Z","timestamp":1725602837081},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642232169"},{"type":"electronic","value":"9783642232176"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23217-6_22","type":"book-chapter","created":{"date-parts":[[2011,8,25]],"date-time":"2011-08-25T09:14:02Z","timestamp":1314263642000},"page":"327-341","source":"Crossref","is-referenced-by-count":4,"title":["Vector Addition System Reversible Reachability Problem"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00f4me","family":"Leroux","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Bouziane, Z., Finkel, A.: Cyclic petri net reachability sets are semi-linear effectively constructible. Electr. Notes Theor. Comput. Sci.\u00a09 (1997)","DOI":"10.1016\/S1571-0661(05)80423-2"},{"key":"22_CR2","first-page":"50","volume-title":"STOC 1976","author":"E. Cardoza","year":"1976","unstructured":"Cardoza, E., Lipton, R.J., Meyer, A.R.: Exponential space complete problems for petri nets and commutative semigroups: Preliminary report. In: STOC 1976, pp. 50\u201354. ACM, New York (1976)"},{"key":"22_CR3","first-page":"245","volume":"52","author":"J. Esparza","year":"1994","unstructured":"Esparza, J., Nielsen, M.: Decidability issues for petri nets - a survey. Bulletin of the European Association for Theoretical Computer Science\u00a052, 245\u2013262 (1994)","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"22_CR4","unstructured":"Hauschildt, D.: Semilinearity of the Reachability Set is Decidable for Petri Nets. PhD thesis, University of Hamburg (1990)"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1145\/800070.802201","volume-title":"Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, (STOC 1982)","author":"S.R. Kosaraju","year":"1982","unstructured":"Rao Kosaraju, S.: Decidability of reachability in vector addition systems (preliminary version). In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (STOC 1982), San Francisco, California, USA, May 5-7, pp. 267\u2013281. ACM, New York (1982)"},{"issue":"1","key":"22_CR6","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0304-3975(92)90173-D","volume":"99","author":"J.L. Lambert","year":"1992","unstructured":"Lambert, J.L.: A structure to decide reachability in petri nets. Theoretical Computer Science\u00a099(1), 79\u2013104 (1992)","journal-title":"Theoretical Computer Science"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Leroux, J.: Vector addition system reachability problem: a short self-contained proof. In: Ball, T., Sagiv, M. (eds.) Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, Austin, TX, USA, January 26-28, pp. 307\u2013316. ACM, New York (2011)","DOI":"10.1145\/1926385.1926421"},{"key":"22_CR8","first-page":"238","volume-title":"Conference Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computation, STOC 1981","author":"E.W. Mayr","year":"1981","unstructured":"Mayr, E.W.: An algorithm for the general petri net reachability problem. In: Conference Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computation, STOC 1981, Milwaukee, Wisconsin, USA, May 11-13, pp. 238\u2013246. ACM, New York (1981)"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-53904-2_94","volume-title":"Rewriting Techniques and Applications","author":"L. Pottier","year":"1991","unstructured":"Pottier, L.: Minimal solutions of linear diophantine systems: Bounds and algorithms. In: Book, R.V. (ed.) RTA 1991. LNCS, vol.\u00a0488, pp. 162\u2013173. Springer, Heidelberg (1991)"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Rackoff, C.: The covering and boundedness problems for vector addition systems. Theoretical Computer Science\u00a06(2) (1978)","DOI":"10.1016\/0304-3975(78)90036-1"},{"key":"22_CR11","first-page":"61","volume-title":"Conference Record of the Ninth Annual ACM Symposium on Theory of Computing","author":"G.S. Sacerdote","year":"1977","unstructured":"Sacerdote, G.S., Tenney, R.L.: The decidability of the reachability problem for vector addition systems (preliminary version). In: Conference Record of the Ninth Annual ACM Symposium on Theory of Computing, Boulder, Colorado, USA, May 2-4, pp. 61\u201376. ACM, New York (1977)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2011 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23217-6_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T07:45:12Z","timestamp":1560498312000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23217-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642232169","9783642232176"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23217-6_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}