{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:59:05Z","timestamp":1725562745509},"publisher-location":"Berlin, Heidelberg","reference-count":6,"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_7","type":"book-chapter","created":{"date-parts":[[2010,8,21]],"date-time":"2010-08-21T03:39:27Z","timestamp":1282361967000},"page":"104-119","source":"Crossref","is-referenced-by-count":8,"title":["Z-Reachability Problem for Games on 2-Dimensional Vector Addition Systems with States Is in P"],"prefix":"10.1007","author":[{"given":"Jakub","family":"Chaloupka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"Proc. International Colloquium on Automata, Languages and Programming","author":"T. Br\u00e1zdil","year":"2010","unstructured":"Br\u00e1zdil, T., Jan\u010dar, P., Ku\u010dera, A.: Reachability games on extended vector addition systems with states. In: Proc. International Colloquium on Automata, Languages and Programming. LNCS. Springer, Heidelberg (2010)"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Chaloupka, J.: Z-reachability problem for games on 2-dimensional vector addition systems with states is in P. Technical Report FIMU-RS-2010-06, Faculty of Informatics, Masaryk University, Brno, Czech Republic (2010)","DOI":"10.1007\/978-3-642-15349-5_7"},{"issue":"2","key":"7_CR3","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 reachablility problem for 5-dimensional vector addition systems. Theoretical Computer Science\u00a08(2), 135\u2013159 (1979)","journal-title":"Theoretical Computer Science"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0304-3975(95)00037-W","volume":"148","author":"P. Jan\u010dar","year":"1995","unstructured":"Jan\u010dar, P.: Undecidability of bisimilarity for petri nets and related problems. Theoretical Computer Science\u00a0148, 281\u2013301 (1995)","journal-title":"Theoretical Computer Science"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1999.2813","volume":"158","author":"P. Jan\u010dar","year":"2000","unstructured":"Jan\u010dar, P.: Decidability of bisimilarity for one-counter processes. Information and Computation\u00a0158, 1\u201317 (2000)","journal-title":"Information and Computation"},{"key":"7_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69968-9","volume-title":"Petri Nets \u2013 An Introduction","author":"W. Reisig","year":"1985","unstructured":"Reisig, W.: Petri Nets \u2013 An Introduction. Springer, Heidelberg (1985)"}],"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_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:04:56Z","timestamp":1606187096000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15349-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153488","9783642153495"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15349-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}