STRUCTURAL REDUCTIONS IN PROCESS ALGEBRA LANGUAGES

For process algebra as a major branch of abstract description languages, almost no work directly exploits the structural symmetry in it. In this paper, a process is defined as an algebraic structure. We define a notion of symmetry for processes based on permutation groups. Given a process and a permutation group over it, we give the quotient process of this process and show that the quotient process is bisimulation equivalent to the original process. Moreover, we present the algorithm for this structural reduction.