Sciweavers

FOSSACS
2004
Springer
13 years 8 months ago
On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds
We prove that if a finite alphabet of actions contains at least two elements, then the equational theory for the process algebra BCCSP modulo any semantics no coarser than readines...
Wan Fokkink, Sumit Nain