{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T09:45:01Z","timestamp":1773654301485,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540671411","type":"print"},{"value":"9783540465416","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46541-3_29","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T16:03:24Z","timestamp":1186070604000},"page":"346-357","source":"Crossref","is-referenced-by-count":18,"title":["Decidability of Reachability Problems for Classes of Two Counters Automata"],"prefix":"10.1007","author":[{"given":"Alain","family":"Finkel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gr\u00e9goire","family":"Sutre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,3,24]]},"reference":[{"key":"29_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/3-540-63141-0_10","volume-title":"Proc. 8th Int. Conf. Concurrency Theory (CONCUR\u201997), Warsaw, Poland, Jul. 1997","author":"A. Bouajjani","year":"1997","unstructured":"A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model-checking. In Proc. 8th Int. Conf. Concurrency Theory (CONCUR\u201997), Warsaw, Poland, Jul. 1997, volume 1243 of Lecture Notes in Computer Science, pages 135\u2013150. Springer, 1997."},{"issue":"6","key":"29_CR2","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0020-0190(86)90087-6","volume":"23","author":"M. Benois","year":"1986","unstructured":"M. Benois and J. Sakarovitch. On the complexity of some extended word problems defined by cancellation rules. Information Processing Letters, 23(6):281\u2013287, 1986.","journal-title":"Information Processing Letters"},{"issue":"1","key":"29_CR3","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0304-3975(92)90278-N","volume":"106","author":"D. Caucal","year":"1992","unstructured":"D. Caucal. On the regular structure of prefix rewriting. Theoretical Computer Science, 106(1):61\u201386, 1992.","journal-title":"Theoretical Computer Science"},{"key":"29_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1007\/3-540-63166-6_31","volume-title":"Proc. of the 9thConference on Computer-Aided Verification (CAV)","author":"G. C\u00e9c\u00e9","year":"1997","unstructured":"G. C\u00e9c\u00e9 and A. Finkel. Programs with quasi-stable channels are effectively recognizable. In Proc. of the 9th\n                        Conference on Computer-Aided Verification (CAV), volume 1254, pages 304\u2013315. LNCS, June 1997."},{"issue":"1","key":"29_CR5","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1006\/inco.1996.0003","volume":"124","author":"G. C\u00e9c\u00e9","year":"1996","unstructured":"G. C\u00e9c\u00e9, A. Finkel, and I. S. Purushothaman. Unreliable channels are easier to verify than perfect channels. Information and Computation, 124(1):20\u201331, 1996.","journal-title":"Information and Computation"},{"key":"29_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/BFb0028751","volume-title":"Proc. 10th Int. Conf. Computer Aided Verification (CAV\u201998), Vancouver, BC, Canada, June\u2013July 1998","author":"H. Comon","year":"1998","unstructured":"H. Comon and Y. Jurski. Multiple counters automata, safety analysis and Presburger arithmetic. In Proc. 10th Int. Conf. Computer Aided Verification (CAV\u201998), Vancouver, BC, Canada, June\u2013July 1998, volume 1427 of Lecture Notes in Computer Science, pages 268\u2013279. Springer, 1998."},{"key":"29_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/BFb0055044","volume-title":"Proc. 25th Int. Coll. Automata, Languages, and Programming (ICALP\u201998), Aalborg, Denmark, July 1998","author":"C. Dufourd","year":"1998","unstructured":"C. Dufourd, A. Finkel, and Ph. Schnoebelen. Reset nets between decidability and undecidability. In Proc. 25th Int. Coll. Automata, Languages, and Programming (ICALP\u201998), Aalborg, Denmark, July 1998, volume 1443 of Lecture Notes in Computer Science, pages 103\u2013115. Springer, 1998."},{"key":"29_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/3-540-48523-6_27","volume-title":"Proc. 26th Int. Coll. Automata, Languages, and Programming (ICALP\u201999), Prague, Czech Republic, July 1999","author":"C. Dufourd","year":"1999","unstructured":"C. Dufourd, P. Jan\u010dar, and Ph. Schnoebelen. Boundedness of Reset P\/T nets. In Proc. 26th Int. Coll. Automata, Languages, and Programming (ICALP\u201999), Prague, Czech Republic, July 1999, volume 1644 of Lecture Notes in Computer Science, pages 301\u2013310. Springer, 1999."},{"key":"29_CR9","unstructured":"C. Dufourd. R\u00e9seaux de Petri avec reset\/transfert: D\u00e9cidabilit\u00e9 et ind\u00e9cidabilit\u00e9. Th\u00e8se de Docteur en Sciences de l\u2019\u00c9cole Normale Sup\u00e9rieure de Cachan, October 1998."},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"A. Finkel, B. Willems, and P. Wolper. A direct symbolic approach to model checking pushdown systems. Electronic Notes in Theoretical Computer Science, 9, 1997.","DOI":"10.1016\/S1571-0661(05)80426-8"},{"key":"29_CR11","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0304-3975(79)90041-0","volume":"8","author":"J. Hopcroft","year":"1979","unstructured":"J. Hopcroft and J. J. Pansiot. On the reachability problem for 5-dimensional vector addition systems. Theoretical Computer Science, 8:135\u2013159, 1979.","journal-title":"Theoretical Computer Science"},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0304-3975(86)90026-5","volume":"46","author":"R. R. Howell","year":"1986","unstructured":"R. R. Howell, L. E. Rosier, D. T. Huynh, and H-C. Yen. Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states. Theoretical Computer Science, 46:107\u2013140, 1986.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"29_CR13","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"R. M. Karp","year":"1969","unstructured":"R. M. Karp and R. E. Miller. Parallel program schemata. Journal of Computer and System Sciences, 3(2):147\u2013195, 1969.","journal-title":"Journal of Computer and System Sciences"},{"key":"29_CR14","unstructured":"K. Reinhardt. Reachability in Petri nets with inhibitor arcs, November 1995. Unpublished manuscript. See \n                  http:\/\/www-fs.informatik.uni-tuebingen.de\/~reinhard\n                  \n                ."}],"container-title":["Lecture Notes in Computer Science","STACS 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46541-3_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T22:43:09Z","timestamp":1550443389000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46541-3_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671411","9783540465416"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-46541-3_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}