Deciding weak bisimilarity of normed context-free processes using tableau

Abstract

Deciding strong and weak bisimilarity of context-free processes are challenging because of the infinite nature of the state space of such processes. Deciding weak bisimilarity is harder since the usual decomposition property which holds for strong bisimilarity fails. Hirshfeld proposed the notion of bisimulation tree to prove that weak bisimulation is decidable for totally normed BPA and BPP processes. Suggested by his idea of decomposition, in this paper we present a tableau method for deciding weak bisimilarity of totally normed context-free processes. Compared with Hirshfeld's bisimulation tree method, our method is more intuitive and more direct. © Springer-Verlag Berlin Heidelberg 2007.