On Finite Alphabets and Infinite Bases III: Simulation

This paper studies the (in)equational theory of simulation preorder and equivalence over the process algebra BCCSP. We prove that in the presence of a finite alphabet with at least two actions, the (in)equational theory of BCCSP modulo simulation preorder or equivalence does not have a finite basis. In contrast, in the presence of an alphabet that is infinite or a singleton, the equational theory for simulation equivalence does have a finite basis.

• Type: Conference
• Year: 2006
• Where: CONCUR
• Authors: Taolue Chen, Wan Fokkink
• Keywords: CONCUR 2006, Distributed And Parallel Computing, Finite Basis, In)equational Theory, Simulation Preorder