On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation

We prove that the equational theory of the process algebra BCCSP modulo completed simulation equivalence does not have a finite basis. Furthermore, we prove that with a finite alphabet of actions, the equational theory of BCCSP modulo ready simulation equivalence does not have a finite basis. In contrast, with an infinite alphabet, the latter equational theory does have a finite basis.

• Type: Conference
• Year: 2006
• Where: FOSSACS
• Authors: Taolue Chen, Wan Fokkink, Sumit Nain
• Keywords: Equational Theory, Finite Basis, FOSSACS 2006, Simulation Equivalence, Software Engineering