Bisimulation trees and the decidability of weak bisimulations

Yoram Hirshfeld*

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review


The development of 'bisimulation trees' as a means to prove decidability of weak bisimulation for restricted classes of BPP and BPA was presented. The notion of a bisimulation tree is a very useful way of presenting the information that concerns a particular notion of bisimulation and a pair of processes which needs to be checked. In the commutative case of BPP if the bisimulation is a congruence and if the tree is finitely branching then large pairs of processes in the tree can be replaced by smaller pairs. In the noncommutative case of totally normed BPA the tree is modified by decomposing large pairs in the tree. If the bisimulation supports unique decomposition in the class then the new finite tree encodes the same information as the old one.

Original languageEnglish
Pages (from-to)2-13
Number of pages12
JournalElectronic Notes in Theoretical Computer Science
StatePublished - 1997
EventInfinity '96, First International Workshop on Verification of Infinite State Systems - Pisa, Italy
Duration: 30 Aug 199631 Aug 1996


Dive into the research topics of 'Bisimulation trees and the decidability of weak bisimulations'. Together they form a unique fingerprint.

Cite this