{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:21:44Z","timestamp":1743092504489,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662242"},{"type":"electronic","value":"9783540485230"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48523-6_47","type":"book-chapter","created":{"date-parts":[[2007,12,10]],"date-time":"2007-12-10T12:06:31Z","timestamp":1197288391000},"page":"503-512","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Simulation Preorder on Simple Process Algebras"],"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,1,18]]},"reference":[{"key":"47_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-Verlag, 1998."},{"key":"47_CR2","doi-asserted-by":"crossref","unstructured":"J.C.M. Baeten and W.P. Weijland. Process Algebra. Number 18 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1990.","DOI":"10.1017\/CBO9780511624193"},{"key":"47_CR3","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-Verlag, 1996."},{"key":"47_CR4","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:61\u201386, 1992.","journal-title":"Theoretical Computer Science"},{"key":"47_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/3-540-57208-2_11","volume-title":"Proceedings of CONCUR\u201993","author":"S. Christensen","year":"1993","unstructured":"S. Christensen, Y. Hirshfeld, and F. Moller. Bisimulation is decidable for all basic parallel processes. In Proceedings of CONCUR\u201993, volume 715 of LNCS, pages 143\u2013157. Springer-Verlag, 1993."},{"key":"47_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1006\/inco.1995.1129","volume":"121","author":"S. Christensen","year":"1995","unstructured":"S. Christensen, H. H\u00fcttel, and C. Stirling. Bisimulation equivalence is decidable for all context-free processes. Information and Computation, 121:143\u2013148, 1995.","journal-title":"Information and Computation"},{"issue":"2","key":"47_CR7","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1006\/inco.1994.1101","volume":"115","author":"J.F. Groote","year":"1994","unstructured":"J.F. Groote and H. H\u00fcttel. Undecidable equivalences for basic process algebra. Information and Computation, 115(2):353\u2013371, 1994.","journal-title":"Information and Computation"},{"key":"47_CR8","unstructured":"J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979."},{"key":"47_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1007\/3-540-57887-0_110","volume-title":"Proceedings of TACS\u201994","author":"H. H\u00fcttel","year":"1994","unstructured":"H. H\u00fcttel. Undecidable equivalences for basic parallel processes. In Proceedings of TACS\u201994, volume 789 of LNCS, pages 454\u2013464. Springer-Verlag, 1994."},{"key":"47_CR10","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-Verlag, 1996."},{"key":"47_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/BFb0055053","volume-title":"Proceedings of ICALP\u201998","author":"P. Jan\u010dar","year":"1998","unstructured":"P. Jan\u010dar, A. Ku\u010dera, and R. Mayr. Deciding bisimulation-like equivalences with finite-state processes. In Proceedings of ICALP\u201998, volume 1443 of LNCS, pages 200\u2013211. Springer-Verlag, 1998."},{"key":"47_CR12","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-Verlag, 1995."},{"key":"47_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/3-540-62034-6_42","volume-title":"Proceedings of FST&TCS\u201996","author":"A. Ku\u010dera","year":"1996","unstructured":"A. Ku\u010dera. Regularity is decidable for normed PA processes in polynomial time. In Proceedings of FST&TCS\u201996, volume 1180 of LNCS, pages 111\u2013122. Springer-Verlag, 1996."},{"key":"47_CR14","doi-asserted-by":"crossref","unstructured":"A. Ku\u010dera and R. Mayr. Weak bisimilarity with infinite-state systems can be decided in polynomial time. Technical report TUM-I9830, Institut f\u00fcr Informatik, TU-M\u00fcnchen, 1998.","DOI":"10.1007\/3-540-48320-9_26"},{"key":"47_CR15","doi-asserted-by":"crossref","unstructured":"A. Ku\u010dera and R. Mayr. Simulation preorder on simple process algebras. Technical report TUM-I9902, Institut f\u00fcr Informatik, TU-M\u00fcnchen, 1999.","DOI":"10.1007\/3-540-48523-6_47"},{"key":"47_CR16","unstructured":"R. Mayr. Process rewrite systems. Information and Computation. To appear."},{"key":"47_CR17","unstructured":"M.L. Minsky. Computation: Finite and Infinite Machines. Prentice-Hall, 1967."},{"issue":"1","key":"47_CR18","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0304-3975(85)90087-8","volume":"37","author":"D.E. Muller","year":"1985","unstructured":"D.E. Muller and P.E. Schupp. The theory of ends, pushdown automata, and second order logic. Theoretical Computer Science, 37(1):51\u201375, 1985.","journal-title":"Theoretical Computer Science"},{"key":"47_CR19","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. van Glabbeek","year":"1990","unstructured":"R.J. van Glabbeek. The linear time\u2014branching time spectrum. In Proceedings of CONCUR\u201990, volume 458 of LNCS, pages 278\u2013297. Springer-Verlag, 1990."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48523-6_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,22]],"date-time":"2022-01-22T03:08:46Z","timestamp":1642820926000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-48523-6_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662242","9783540485230"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-48523-6_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"18 January 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}