{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:26:57Z","timestamp":1725460017379},"publisher-location":"Boston","reference-count":21,"publisher":"Kluwer Academic Publishers","isbn-type":[{"type":"print","value":"1402081405"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/1-4020-8141-3_39","type":"book-chapter","created":{"date-parts":[[2006,2,21]],"date-time":"2006-02-21T15:15:11Z","timestamp":1140534911000},"page":"507-520","source":"Crossref","is-referenced-by-count":1,"title":["Highly Undecidable Questions for Process Algebras"],"prefix":"10.1007","author":[{"given":"Petr","family":"Jan\u010dar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji\u0159i","family":"Srba Brics","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01969548","volume":"6","author":"J.R. B\u00fcchi","year":"1964","unstructured":"B\u00fcchi, J.R. (1964). Regular canonical systems. Arch. Math. Logik u. Grundlagenforschung, 6:91\u2013111.","journal-title":"Arch. Math. Logik u. Grundlagenforschung"},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"Burkart, O., Caucal, D., Moller, F., and Steffen, B. (2001). Verification on infinite structures. In Bergstra, J., Ponse, A., and Smolka, S., editors, Handbook of Process Algebra, chapter 9, pages 545\u2013623. Elsevier Science.","DOI":"10.1016\/B978-044482830-9\/50027-8"},{"key":"39_CR3","doi-asserted-by":"crossref","first-page":"13","DOI":"10.3233\/FI-1997-3112","volume":"31","author":"J. Esparza","year":"1997","unstructured":"Esparza, J. (1997). Petri nets, commutative context-free grammars, and basic parallel processes. Fundamenta Informaticae, 31:13\u201326.","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"39_CR4","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1006\/inco.1994.1101","volume":"115","author":"J.F. Groote","year":"1994","unstructured":"Groote, J.F. and H\u00fcttel, H. (1994). Undecidable equivalences for basic process algebra. Information and Computation, 115(2):353\u2013371.","journal-title":"Information and Computation"},{"issue":"1","key":"39_CR5","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1145\/4904.4993","volume":"33","author":"D. Harel","year":"1986","unstructured":"Harel, D. (1986). Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness. Journal of the ACM (JACM), 33(1):224\u2013248.","journal-title":"Journal of the ACM (JACM)"},{"key":"39_CR6","unstructured":"Hirshfeld, Y. (1994). Deciding equivalences in simple process algebras. Tech. report ECS-LFCS-94-294, Dept. of Computer Science, University of Edinburgh."},{"key":"39_CR7","first-page":"454","volume":"789","author":"H. H\u00fcttel","year":"1994","unstructured":"H\u00fcttel, H. (1994). Undecidable equivalences for basic parallel processes. In Proc. of TACS\u201994, volume 789 of LNCS, pages 454\u2013464. Springer-Verlag.","journal-title":"LNCS"},{"key":"39_CR8","unstructured":"Jan\u010dar, P. (2003). Strong bisimilarity on basic parallel processes is PSPACEcomplete. In Proc. of LICS\u201903, pages 218\u2013227. IEEE Computer Society Press."},{"key":"39_CR9","first-page":"159","volume":"2761","author":"P. Jan\u010dar","year":"2003","unstructured":"Jan\u010dar, P., Ku\u010dera, A., and Moller, F. (2003). Deciding bisimilarity between bpa and bpp processes. In Proc. of CONCUR\u201903, volume 2761 of LNCS, pages 159\u2013173. Springer-Verlag.","journal-title":"LNCS"},{"key":"39_CR10","doi-asserted-by":"crossref","unstructured":"Jan\u010dar, P. and Srba, J. (2004). Highly Undecidable questions for process algebras. Tech. Report RS-04-8, BRICS Research Series.","DOI":"10.1007\/1-4020-8141-3_39"},{"key":"39_CR11","first-page":"41","volume":"2540","author":"A. Ku\u010dera","year":"2002","unstructured":"Ku\u010dera, A., and Jan\u010dar, P. (2002). Equivalence-checking with infinite-state systems: Techniques and results. In Proc. of SOFSEM\u201902, volume 2540 of LNCS, pages 41\u201373. Springer-Verlag.","journal-title":"LNCS"},{"issue":"1\u20132","key":"39_CR12","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0304-3975(00)00306-6","volume":"274","author":"D. Lugiez","year":"2002","unstructured":"Lugiez, D. and Schnoebelen, Ph. (2002). The regular viewpoint on pa-processes. Theoretical Computer Science, 274(1\u20132): 89\u2013115.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"39_CR13","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1006\/inco.1999.2826","volume":"156","author":"R. Mayr","year":"2000","unstructured":"Mayr, R. (2000). Process rewrite systems. Information and Computation, 156(1):264\u2013286.","journal-title":"Information and Computation"},{"key":"39_CR14","unstructured":"Mayr, R. (2003). Weak bisimilarity and regularity of BPA is EXPTIME-hard. In Proc. of EXPRESS\u201903, pages 160\u2013143."},{"key":"39_CR15","unstructured":"Rogers, H. (1967). Theory of Recursive Functions and Effective Computability. McGraw-Hill."},{"key":"39_CR16","first-page":"163","volume":"78","author":"J. Srba","year":"2002","unstructured":"Srba, J. (2002). Roadmap of infinite results. Bulletin of the European Association for Theoretical Computer Science (Columns: Concurrency), 78:163\u2013175. Updated online version: http:\/\/www.brics.dk\/~srba\/roadmap .","journal-title":"Bulletin of the European Association for Theoretical Computer Science (Columns: Concurrency)"},{"key":"39_CR17","unstructured":"Srba, J. (2003a). Completeness results for undecidable bisimilarity problems. In Proc. of INFINITY\u201903, pages 9\u201322."},{"key":"39_CR18","first-page":"197","volume":"2450","author":"J. Srba","year":"2003","unstructured":"Srba, J. (2003b). Undecidability of weak bisimilarity for PA-processes. In Proc. of DLT\u201902, volume 2450 of LNCS, pages 197\u2013208. Springer-Verlag.","journal-title":"LNCS"},{"key":"39_CR19","first-page":"66","volume":"715","author":"R.J. Glabbeek van","year":"1993","unstructured":"van Glabbeek, R.J. (1993). The linear time-branching time spectrum II (the semantics of sequential systems with silent moves). In Proc. of CONCUR\u2019 93, volume 715 of LNCS, pages 66\u201381. Springer-Verlag.","journal-title":"LNCS"},{"key":"39_CR20","unstructured":"van Glabbeek, R.J. (2001). The linear time-branching time spectrum I: The semantics of concrete, sequential processes. In Handbook of Process Algebra, chapter 1, pages 3\u201399. Elsevier Science."},{"issue":"3","key":"39_CR21","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/233551.233556","volume":"43","author":"R.J. Glabbeek van","year":"1996","unstructured":"van Glabbeek, R.J. and Weijland, W.P. (1996). Branching time and abstraction in bisimulation semantics. Journal of the ACM, 43(3):555\u2013600.","journal-title":"Journal of the ACM"}],"container-title":["IFIP International Federation for Information Processing","Exploring New Frontiers of Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/1-4020-8141-3_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:47:38Z","timestamp":1605642458000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/1-4020-8141-3_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["1402081405"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/1-4020-8141-3_39","relation":{},"subject":[]}}