Sciweavers

FOSSACS
2006
Springer

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

14 years 3 months ago
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.
Taolue Chen, Wan Fokkink, Sumit Nain
Added 22 Aug 2010
Updated 22 Aug 2010
Type Conference
Year 2006
Where FOSSACS
Authors Taolue Chen, Wan Fokkink, Sumit Nain
Comments (0)