Silence is Golden: Branching Bisimilarity is Decidable for Context-free Processes

Hans Hüttel

Abstract: We show that the branching bisimulation equivalence introduced by Rob van Glabbeek is decidable for the class of normed, recursively defined BPA processes with silent actions, thus generalizing the decidability result for strong bisimilarity by Baeten, Bergstra and Klop.

Note: This is the full, revised version of the paper with the same title that appeared at the 3rd International Workshop on Computer-Aided Verification (CAV91) in Aalborg, 1-4 July 1991.

LFCS report ECS-LFCS-91-173

Previous | Index | Next