{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:59:07Z","timestamp":1725562747607},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153488"},{"type":"electronic","value":"9783642153495"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15349-5_9","type":"book-chapter","created":{"date-parts":[[2010,8,21]],"date-time":"2010-08-21T03:39:27Z","timestamp":1282361967000},"page":"133-145","source":"Crossref","is-referenced-by-count":0,"title":["Rewriting Systems for Reachability in Vector Addition Systems with Pairs"],"prefix":"10.1007","author":[{"given":"Paulin","family":"Jacob\u00e9 de Naurois","sequence":"first","affiliation":[]},{"given":"Virgile","family":"Mogbil","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Br\u00e1zdil, T., Jancar, P., Kucera, A.: Reachability games on extended vector addition systems with states. CoRR (2010) abs\/1002.2557"},{"key":"9_CR2","first-page":"64","volume-title":"LICS","author":"P. Groote de","year":"2004","unstructured":"de Groote, P., Guillaume, B., Salvati, S.: Vector addition tree automata. In: LICS, pp. 64\u201373. IEEE Computer Society, Los Alamitos (2004)"},{"key":"9_CR3","unstructured":"Demri, S., Jurdzinski, M., Lachish, O., Lazic, R.: The covering and boundedness problems for branching vector addition systems. In: Kannan, R., Kumar, K.N. (eds.) FSTTCS. LIPIcs, vol.\u00a04, pp. 181\u2013192 (2009)"},{"key":"9_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":"9_CR5","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0166-218X(93)90045-P","volume":"42","author":"G. Gallo","year":"1993","unstructured":"Gallo, G., Longo, G., Pallottino, S.: Directed hypergraphs and applications. Discrete Applied Mathematics\u00a042(2), 177\u2013201 (1993)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"9_CR6","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.H.: Semigroups, presburger formulas, and languages. Pacific Journal of Mathematic\u00a016(2), 285\u2013296 (1966)","journal-title":"Pacific Journal of Mathematic"},{"issue":"3","key":"9_CR7","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0022-0000(80)90009-4","volume":"20","author":"A. Ginzburg","year":"1980","unstructured":"Ginzburg, A., Yoeli, M.: Vector addition systems and regular languages. J. Comput. Syst. Sci.\u00a020(3), 277\u2013284 (1980)","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. Theor. Comput. Sci.\u00a050, 1\u2013102 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0304-3975(79)90041-0","volume":"8","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Pansiot, J.-J.: On the reachability problem for 5-dimensional vector addition systems. TCS\u00a08, 135\u2013159 (1979)","journal-title":"TCS"},{"issue":"2","key":"9_CR10","doi-asserted-by":"crossref","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. J. Comput. Syst. Sci.\u00a03(2), 147\u2013195 (1969)","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR11","first-page":"267","volume-title":"STOC","author":"S.R. Kosaraju","year":"1982","unstructured":"Kosaraju, S.R.: Decidability of reachability in vector addition systems (preliminary version). In: STOC, pp. 267\u2013281. ACM, New York (1982)"},{"issue":"1","key":"9_CR12","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. Theor. Comput. Sci.\u00a099(1), 79\u2013104 (1992)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"9_CR13","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"E.W. Mayr","year":"1984","unstructured":"Mayr, E.W.: An algorithm for the general petri net reachability problem. SIAM J. Comput.\u00a013(3), 441\u2013460 (1984)","journal-title":"SIAM J. Comput."},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/3-540-15204-0_21","volume-title":"Advances in Petri Nets 1984","author":"H. M\u00fcller","year":"1985","unstructured":"M\u00fcller, H.: The reachability problem for vas. In: Rozenberg, G., Genrich, H.J., Roucairol, G. (eds.) APN 1984. LNCS, vol.\u00a0188, pp. 376\u2013391. Springer, Heidelberg (1985)"},{"issue":"4","key":"9_CR15","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R. Parikh","year":"1966","unstructured":"Parikh, R.: On context-free languages. J. ACM\u00a013(4), 570\u2013581 (1966)","journal-title":"J. ACM"},{"issue":"2","key":"9_CR16","doi-asserted-by":"crossref","first-page":"201","DOI":"10.3233\/FI-1998-33204","volume":"33","author":"D. Plump","year":"1998","unstructured":"Plump, D.: Termination of graph rewriting is undecidable. Fundam. Inform.\u00a033(2), 201\u2013209 (1998)","journal-title":"Fundam. Inform."},{"key":"9_CR17","unstructured":"Reutenauer, C.: Aspects Math\u00e9matiques des R\u00e9seaux de P\u00e9tri. Masson (1989)"},{"issue":"1","key":"9_CR18","first-page":"217","volume":"7","author":"K.N. Verma","year":"2005","unstructured":"Verma, K.N., Goubault-Larrecq, J.: Karp-miller trees for a branching extension of vass. Discrete Mathematics & Theoretical Computer Science\u00a07(1), 217\u2013230 (2005)","journal-title":"Discrete Mathematics & Theoretical Computer Science"},{"issue":"6","key":"9_CR19","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1016\/j.ic.2006.12.006","volume":"205","author":"K.N. Verma","year":"2007","unstructured":"Verma, K.N., Goubault-Larrecq, J.: Alternating two-way ac-tree automata. Inf. Comput.\u00a0205(6), 817\u2013869 (2007)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15349-5_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:04:57Z","timestamp":1606187097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15349-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153488","9783642153495"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15349-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}