TY - JOUR

T1 - Bisimulation trees and the decidability of weak bisimulations

AU - Hirshfeld, Yoram

PY - 1997

Y1 - 1997

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=12444310592&partnerID=8YFLogxK

U2 - 10.1016/S1571-0661(05)80674-7

DO - 10.1016/S1571-0661(05)80674-7

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:12444310592

SN - 1571-0661

VL - 5

SP - 2

EP - 13

JO - Electronic Notes in Theoretical Computer Science

JF - Electronic Notes in Theoretical Computer Science

T2 - Infinity '96, First International Workshop on Verification of Infinite State Systems

Y2 - 30 August 1996 through 31 August 1996

ER -