Learn More
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irre-dundant context-free grammars. In this paper we provide a much simpler and much more direct proof of this result using a tableau decision method involving goal-directed rules. The decision procedure also provides the essential(More)
Over the past decade much attention has been devoted to the study of process calculi such as CCS Mil80, Mil89], ACP BK84, BK88] and CSP Hoa88] as the foundations of a mathematical model for nondeterminism and concurrency. Of particular interest has been the study of the behavioural semantics of these calculi as given by transition graphs arising from(More)