Deciding strong and weak bisimilarity of BPP 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. In this paper, we present a tableau method to decide weak bisimilarity of totally normed BPP. Compared with Hirshfeld's bisimulation tree method, our method is more intuitive and more direct. Moreover from the decidability proof we can derive a complete axiomatisation for the weak bisimulation of totally normed BPP. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Chen, H. (2008). More on weak bisimilarity of normed basic parallel processes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4978 LNCS, pp. 192–203). Springer Verlag. https://doi.org/10.1007/978-3-540-79228-4_17
Mendeley helps you to discover research relevant for your work.