{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:33:20Z","timestamp":1778297600531,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540671411","type":"print"},{"value":"9783540465416","type":"electronic"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46541-3_28","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T16:03:24Z","timestamp":1186070604000},"page":"334-345","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Simulation and Bisimulation over One-Counter Processes"],"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"}]}],"member":"297","published-online":{"date-parts":[[2000,3,24]]},"reference":[{"key":"28_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.A. Abdulla","year":"1998","unstructured":"P.A. 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":"28_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/3-540-61604-7_59","volume-title":"Proceedings of CONCUR\u201996","author":"O. Burkart","year":"1996","unstructured":"O. Burkart, D. Caucal, and B. Steffen. Bisimulation collapse and the process taxonomy. In Proceedings of CONCUR\u201996, volume 1119 of LNCS, pages 247\u2013262. Springer, 1996."},{"key":"28_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/3-540-63165-8_210","volume-title":"Proceedings of ICALP\u201997","author":"P. Jan\u010dar","year":"1997","unstructured":"P. Jan\u010dar. Bisimulation equivalence is decidable for one-counter processes. In Proceedings of ICALP\u201997, volume 1256 of LNCS, pages 549\u2013559. Springer, 1997."},{"key":"28_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1007\/3-540-61440-0_152","volume-title":"Proceedings of ICALP\u201996","author":"P. Jan\u010dar","year":"1996","unstructured":"P. Jan\u010dar and J. Esparza. Deciding finiteness of Petri nets up to bisimilarity. In Proceedings of ICALP\u201996, volume 1099 of LNCS, pages 478\u2013489. Springer, 1996."},{"key":"28_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1007\/3-540-60218-6_26","volume-title":"Proceedings of CONCUR\u201995","author":"P. Jan\u010dar","year":"1995","unstructured":"P. Jan\u010dar and F. Moller. Checking regular properties of Petri nets. In Proceedings of CONCUR\u201995, volume 962 of LNCS, pages 348\u2013362. Springer, 1995."},{"key":"28_CR6","unstructured":"P. Jan\u010dar and F. Moller. Simulation of one-counter nets via colouring. In Proceedings of Workshop Journ\u00e9es Syst\u00e8mes Infinis, LSV-ENS Cachan, pages 1\u20136, November 1998. (Revised version, Research Report 159, Computing Science Department, Uppsala University, 1999.)"},{"key":"28_CR7","series-title":"Lect Notes Comput Sci","first-page":"398","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 398\u2013407. Springer, 1999."},{"issue":"1","key":"28_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0020-0190(99)00029-0","volume":"70","author":"A. Ku\u010dera","year":"1999","unstructured":"A. Ku\u010dera. On finite representations of infinite-state behaviours. Information Processing Letters, 70(1):23\u201330, 1999.","journal-title":"Information Processing Letters"},{"key":"28_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/3-540-48168-0_35","volume-title":"Proceedings of CSL\u201999","author":"A. Ku\u010dera","year":"1999","unstructured":"A. Ku\u010dera and J. Esparza. A logical viewpoint on process-algebraic quotients. In Proceedings of CSL\u201999, volume 1683 of LNCS, pages 499\u2013514. Springer, 1999."},{"key":"28_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":"28_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/978-3-540-48654-1_4","volume-title":"Proceedings of CONCUR\u201994","author":"S. Mauw","year":"1994","unstructured":"S. Mauw and H. Mulder. Regularity of BPA-systems is decidable. In Proceedings of CONCUR\u201994, volume 836 of LNCS, pages 34\u201347. Springer, 1994."},{"key":"28_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/3-540-61604-7_56","volume-title":"Proceedings of CONCUR\u201996","author":"F. Moller","year":"1996","unstructured":"F. Moller. Infinite results. In Proceedings of CONCUR\u201996, volume 1119 of LNCS, pages 195\u2013216. Springer, 1996."},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"G. S\u00e9nizergues. Decidability of bisimulation equivalence for equational graphs of finite out-degree. In Proceedings of 39th Annual Symposium on Foundations of Computer Science, pages 120\u2013129. IEEE Computer Society Press, 1998.","DOI":"10.1109\/SFCS.1998.743435"},{"key":"28_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/BFb0039066","volume-title":"Proceedings of CONCUR\u201990","author":"R.J. Glabbeek van","year":"1990","unstructured":"R.J. van Glabbeek. The linear time \u2014 branching time spectrum. In Proceedings of CONCUR\u201990, volume 458 of LNCS, pages 278\u2013297. Springer, 1990."}],"container-title":["Lecture Notes in Computer Science","STACS 2000"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46541-3_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T02:55:36Z","timestamp":1737341736000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46541-3_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671411","9783540465416"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-46541-3_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"24 March 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}