Undecidable equivalences for basic parallel processes

Bergstra, 1984, Process algebra for synchronous communication, Information and Control, 60, 109, 10.1016/S0019-9958(84)80025-X Christensen, 1993, Bisimulation is decidable for all basic parallel processes, vol. 715 Christensen, 1993, Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes, 386 Christensen, 1995, Bisimulation equivalence is decidable for all context-free processes, Information and Computation, 121, 143, 10.1006/inco.1995.1129 Groote, 1994, Undecidable equivalences for basic process algebra, Information and Computation, 115, 354, 10.1006/inco.1994.1101 Groote, 1989, Structural operational semantics and bisimulation as a congruence (extended abstract), vol. 372, 423 Hirshfeld, 1993, Petri nets and the equivalence problem, vol. 832, 165 Hopcroft, 1979 Hüttel, 1994, Undecidable equivalence for basic parallel processes, vol. 789, 454 Huynh, 1995, On deciding readiness and failure equivalences for processes, Information and Computation, 117, 193, 10.1006/inco.1995.1039 Kanellakis, 1990, CCS expressions, finite state processes, and three problems of equivalence, Information and Computation, 86, 43, 10.1016/0890-5401(90)90025-D Kobayashi, 2003, Type systems for concurrent programs, vol. 2757, 439 Kobayashi, 2007, Undecidability of 2-label BPP equivalences and behavioral type systems for the π-calculus, vol. 4596, 740 Milner, 1989 Minsky, 1967 Park, 1981, Concurrency and automata on infinite sequences, vol. 104, 167 Rounds, 1981, Possible futures, acceptances, refusals, and communicating processes, 140 Srba, 2001, On the power of labels in transition systems, vol. 2154, 277 van Glabbeek, 1990, The linear time–branching time spectrum, vol. 458, 278