{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T03:17:48Z","timestamp":1773717468087,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540440437","type":"print"},{"value":"9783540456940","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45694-5_39","type":"book-chapter","created":{"date-parts":[[2007,10,5]],"date-time":"2007-10-05T07:44:18Z","timestamp":1191570258000},"page":"594-609","source":"Crossref","is-referenced-by-count":13,"title":["Why Is Simulation Harder than Bisimulation?"],"prefix":"10.1007","author":[{"given":"Anton\u00edn","family":"Ku\u010dera","sequence":"first","affiliation":[]},{"given":"Richard","family":"Mayr","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,18]]},"reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"P. A. Abdulla and B. Jonsson. Verifying programs with unreliable channels. In Proceedings of LICS\u201993, pages 160\u2013170. IEEE Computer Society Press, 1993.","DOI":"10.1109\/LICS.1993.287591"},{"issue":"6A","key":"39_CR2","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1007\/BF03180566","volume":"4","author":"J. Balc\u00e1zar","year":"1992","unstructured":"J. Balc\u00e1zar, J. Gabarr\u00f3, and M. S\u00e1ntha. Deciding bisimilarity is P-complete. Formal Aspects of Computing, 4(6A):638\u2013648, 1992.","journal-title":"Formal Aspects of Computing"},{"key":"39_CR3","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"J. A. Bergstra","year":"1985","unstructured":"J. A. Bergstra and J. W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, 37:77\u2013121, 1985.","journal-title":"Theoretical Computer Science"},{"key":"39_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/3-540-49116-3_30","volume-title":"Model-checking lossy vector addition systems","author":"A. Bouajjani","year":"1999","unstructured":"A. Bouajjani and R. Mayr. Model-checking lossy vector addition systems. In Proceedings of STACS\u201999, volume 1563 of LNCS, pages 323\u2013333. Springer, 1999."},{"key":"39_CR5","unstructured":"S. Christensen. Decidability and Decomposition in Process Algebras. PhD thesis, The University of Edinburgh, 1993."},{"key":"39_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/3-540-46541-3_28","volume-title":"Simulation and bisimulation over onecounter processes","author":"P. Jan\u010dar","year":"2000","unstructured":"P. Jan\u010dar, A. Ku\u010dera, and F. Moller. Simulation and bisimulation over onecounter processes. In Proceedings of STACS 2000, volume 1770 of LNCS, pages 334\u2013345. Springer, 2000."},{"key":"39_CR7","series-title":"Lect Notes Comput Sci","volume-title":"On the complexity of semantic equivalences for pushdown automata and BPA","author":"A. Ku\u010dera","year":"2002","unstructured":"A. Ku\u010dera and R. Mayr. On the complexity of semantic equivalences for pushdown automata and BPA. In Proceedings of MFCS2002, LNCS. Springer, 2002. To appear."},{"issue":"2","key":"39_CR8","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1006\/inco.2001.3122","volume":"173","author":"A. Ku\u010dera","year":"2002","unstructured":"A. Ku\u010dera and R. Mayr. Simulation preorder over simple process algebras. Information and Computation, 173(2):184\u2013198, 2002.","journal-title":"Information and Computation"},{"key":"39_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1007\/3-540-44929-9_33","volume-title":"On the complexity of bisimulation problems for pushdown automata","author":"R. Mayr","year":"2000","unstructured":"R. Mayr. On the complexity of bisimulation problems for pushdown automata. In Proceedings of IFIP TCS\u20192000, volume 1872 of LNCS, pages 474\u2013488. Springer, 2000."},{"key":"39_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/3-540-61604-7_56","volume-title":"Infinite results","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":"39_CR11","unstructured":"J. L. Peterson. Petri Net Theory and the Modelling of Systems. Prentice-Hall, 1981."},{"key":"39_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/3-540-45627-9_29","volume-title":"P-hardness of equivalence testing on finite-state processes","author":"Z. Sawa","year":"2001","unstructured":"Z. Sawa and P. Jan\u010dar. P-hardness of equivalence testing on finite-state processes. In Proceedings of SOFSEM\u20192001, volume 2234 of LNCS, pages 326\u2013335. Springer, 2001."},{"key":"39_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/BFb0055763","volume-title":"The joys of bisimulation","author":"C. Stirling","year":"1998","unstructured":"C. Stirling. The joys of bisimulation. In Proceedings of MFCS\u201998, volume 1450 of LNCS, pages 142\u2013151. Springer, 1998."},{"key":"39_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/3-540-56610-4_89","volume-title":"On the Ehrenfeucht-Fra\u00efss\u00e9 game in theoretical computer science","author":"W. Thomas","year":"1993","unstructured":"W. Thomas. On the Ehrenfeucht-Fra\u00efss\u00e9 game in theoretical computer science. In Proceedings of TAPSOFT\u201993, volume 668 of LNCS, pages 559\u2013568. Springer, 1993."},{"key":"39_CR15","unstructured":"R. van Glabbeek. The linear time-branching time spectrum. Handbook of Process Algebra, pages 3\u201399, 1999."}],"container-title":["Lecture Notes in Computer Science","CONCUR 2002 \u2014 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45694-5_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,23]],"date-time":"2019-02-23T23:39:52Z","timestamp":1550965192000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45694-5_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440437","9783540456940"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45694-5_39","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}