{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T18:25:23Z","timestamp":1791138323083,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642401831","type":"print"},{"value":"9783642401848","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40184-8_11","type":"book-chapter","created":{"date-parts":[[2013,7,22]],"date-time":"2013-07-22T21:50:56Z","timestamp":1374529856000},"page":"137-151","source":"Crossref","is-referenced-by-count":3,"title":["A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00f4me","family":"Leroux","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.","family":"Praveen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gr\u00e9goire","family":"Sutre","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"4","key":"11_CR1","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1142\/S0129054111008428","volume":"22","author":"M.F. Atig","year":"2011","unstructured":"Atig, M.F., Habermehl, P.: On Yen\u2019s path logic for Petri nets. Int. J. Found. Comput. Sci.\u00a022(4), 783\u2013799 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-642-22993-0_13","volume-title":"Mathematical Foundations of Computer Science 2011","author":"M. Blockelet","year":"2011","unstructured":"Blockelet, M., Schmitz, S.: Model checking coverability graphs of vector addition systems. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol.\u00a06907, pp. 108\u2013119. Springer, Heidelberg (2011)"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Demri, S.: On selective unboundedness of VASS. In: Proc. INFINITY. EPTCS, vol.\u00a039, pp. 1\u201315 (2010)","DOI":"10.4204\/EPTCS.39.1"},{"key":"11_CR4","first-page":"244","volume":"52","author":"J. Esparza","year":"1994","unstructured":"Esparza, J., Nielsen, M.: Decidability issues for Petri nets - a survey. Bulletin of the EATCS\u00a052, 244\u2013262 (1994)","journal-title":"Bulletin of the EATCS"},{"issue":"2","key":"11_CR5","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"R.M. Karp","year":"1969","unstructured":"Karp, R.M., Miller, R.E.: Parallel program schemata. Journal of Computer and System Sciences\u00a03(2), 147\u2013195 (1969)","journal-title":"Journal of Computer and System Sciences"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Kosaraju, S.R.: Decidability of reachability in vector addition systems. In: Proc.\u00a0STOC, pp. 267\u2013281. ACM (1982)","DOI":"10.1145\/800070.802201"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Leroux, J.: Vector addition system reversible reachability problem. Logical Methods in Computer Science\u00a09(1) (2013)","DOI":"10.2168\/LMCS-9(1:5)2013"},{"key":"11_CR8","unstructured":"Leroux, J., Penelle, V., Sutre, G.: On the context-freeness problem for vector addition systems. In: Proc.\u00a0LICS. IEEE (to appear, 2013)"},{"key":"11_CR9","unstructured":"Lipton, R.J.: The reachability problem requires exponential space. Technical Report\u00a062, Yale University (1976)"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Mayr, E.W.: An algorithm for the general Petri net reachability problem. In: Proc.\u00a0STOC, pp. 238\u2013246. ACM (1981)","DOI":"10.1145\/800076.802477"},{"issue":"3","key":"11_CR11","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1145\/322261.322271","volume":"28","author":"E.W. Mayr","year":"1981","unstructured":"Mayr, E.W., Meyer, A.R.: The complexity of the finite containment problem for Petri nets. J. ACM\u00a028(3), 561\u2013576 (1981)","journal-title":"J. ACM"},{"key":"11_CR12","doi-asserted-by":"crossref","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)","DOI":"10.1007\/3-540-53904-2_94"},{"issue":"2","key":"11_CR13","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(78)90036-1","volume":"6","author":"C. Rackoff","year":"1978","unstructured":"Rackoff, C.: The covering and boundedness problems for vector addition systems. Theoretical Computer Science\u00a06(2), 223\u2013231 (1978)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"11_CR14","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0304-3975(92)90002-W","volume":"98","author":"S.R. Schwer","year":"1992","unstructured":"Schwer, S.R.: The context-freeness of the languages associated with vector addition systems is decidable. Theor. Comput. Sci.\u00a098(2), 199\u2013247 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/BF00289715","volume":"21","author":"R. Valk","year":"1985","unstructured":"Valk, R., Jantzen, M.: The residue of vector sets with applications to decidability problems in Petri nets. Acta Inf.\u00a021, 643\u2013674 (1985)","journal-title":"Acta Inf."},{"issue":"3","key":"11_CR16","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0022-0000(81)90067-2","volume":"23","author":"R. Valk","year":"1981","unstructured":"Valk, R., Vidal-Naquet, G.: Petri nets and regular languages. Journal of Computer and System Sciences\u00a023(3), 299\u2013325 (1981)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"11_CR17","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0890-5401(92)90059-O","volume":"96","author":"H.-C. Yen","year":"1992","unstructured":"Yen, H.-C.: A unified approach for deciding the existence of certain Petri net paths. Inf. Comput.\u00a096(1), 119\u2013137 (1992)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","CONCUR 2013 \u2013 Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40184-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T22:08:03Z","timestamp":1558303683000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40184-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401831","9783642401848"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40184-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}