{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:44:00Z","timestamp":1725486240324},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433668"},{"type":"electronic","value":"9783540459316"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45931-6_13","type":"book-chapter","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T04:53:52Z","timestamp":1181364832000},"page":"172-186","source":"Crossref","is-referenced-by-count":1,"title":["Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds*"],"prefix":"10.1007","author":[{"given":"Petr","family":"Jan\u010dar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anton\u00edn","family":"Ku\u010dera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Faron","family":"Moller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zden\u011bk","family":"Sawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"key":"13_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BFb0055627","volume-title":"Proceedings of CONCUR\u201998","author":"P. Abdulla","year":"1998","unstructured":"P. Abdulla and K. \u010cer\u0101ns. Simulation is decidable for one-counter nets. In Proceedings of CONCUR\u201998, volume 1466 of LNCS, pages 253\u2013268. Springer, 1998."},{"key":"13_CR2","unstructured":"E. Bach and J. Shallit. Algorithmic Number Theory. Vol. 1, Efficient Algorithms. The MIT Press, 1996."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"E. Emerson. Temporal and modal logic. Handbook of Theoretical Computer Science, B, 1991.","DOI":"10.1016\/B978-0-444-88074-1.50021-4"},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1999.2813","volume":"158","author":"P. Jan\u010dar","year":"2000","unstructured":"P. Jan\u010dar. Decidability of bisimilarity for one-counter processes. Information and Computation, 158(1):1\u201317, 2000.","journal-title":"Information and Computation"},{"issue":"1\u20132","key":"13_CR5","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/S0304-3975(00)00027-X","volume":"258","author":"P. Jan\u010dar","year":"2001","unstructured":"P. Jan\u010dar, A. Ku\u010dera, and R. Mayr. Deciding bisimulation-like equivalences with finite-state processes. Theoretical Computer Science, 258(1\u20132):409\u2013433, 2001.","journal-title":"Theoretical Computer Science"},{"key":"13_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/3-540-46541-3_28","volume-title":"Proceedings of STACS 2000","author":"P. Jan\u010dar","year":"2000","unstructured":"P. Jan\u010dar, A. Ku\u010dera, and F. Moller. Simulation and bisimulation over one-counter processes. In Proceedings of STACS 2000, volume 1770 of LNCS, pages 334\u2013345. Springer, 2000."},{"key":"13_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1007\/3-540-47849-3_28","volume-title":"Proceedings of SOFSEM\u201999","author":"P. Jan\u010dar","year":"1999","unstructured":"P. Jan\u010dar, F. Moller, and Z. Sawa. Simulation problems for one-counter machines. In Proceedings of SOFSEM\u201999, volume 1725 of LNCS, pages 404\u2013413. Springer, 1999."},{"key":"13_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/3-540-45022-X_28","volume-title":"Proceedings of ICALP 2000","author":"A. Ku\u010dera","year":"2000","unstructured":"A. Ku\u010dera. Efficient verification algorithms for one-counter processes. In Proceedings of ICALP 2000, volume 1853 of LNCS, pages 317\u2013328. Springer, 2000."},{"key":"13_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-44464-5_11","volume-title":"Proceedings of ASIAN 2000","author":"A. Ku\u010dera","year":"2000","unstructured":"A. Ku\u010dera. On simulation-checking with sequential systems. In Proceedings of ASIAN 2000, volume 1961 of LNCS, pages 133\u2013148. Springer, 2000."},{"key":"13_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/3-540-48523-6_47","volume-title":"Proceedings of ICALP\u201999","author":"A. Ku\u010dera","year":"1999","unstructured":"A. Ku\u010dera and R. Mayr. Simulation preorder on simple process algebras. In Proceedings of ICALP\u201999, volume 1644 of LNCS, pages 503\u2013512. Springer, 1999."},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"R. Mayr. Strict lower bounds for model checking BPA. Electronic Notes in Theoretical Computer Science, 18, 1998.","DOI":"10.1016\/S1571-0661(05)80256-7"},{"key":"13_CR12","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall, 1989."},{"key":"13_CR13","unstructured":"C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994."},{"key":"13_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Proceedings 5th GI Conference","author":"D. Park","year":"1981","unstructured":"D. Park. Concurrency and automata on infinite sequences. In Proceedings 5 th GI Conference, volume 104 of LNCS, pages 167\u2013183. Springer, 1981."},{"key":"13_CR15","unstructured":"R. van Glabeek. The linear time-branching time spectrum I. In J. Bergstra, A. Ponse, and S. Smolka, editors, Handbook of Process Algebra, pages 3\u201399. Elsevier, 2001."},{"issue":"2","key":"13_CR16","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.2000.2894","volume":"164","author":"I. Walukiewicz","year":"2001","unstructured":"I. Walukiewicz. Pushdown processes: Games and model-checking. Information and Computation, 164(2):234\u2013263, 2001.","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45931-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T23:19:25Z","timestamp":1556493565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45931-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433668","9783540459316"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45931-6_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}