Sciweavers

194
Voted
FOSSACS
2006
Springer
15 years 11 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 alph...
Taolue Chen, Wan Fokkink, Sumit Nain
164
Voted
ICALP
1999
Springer
15 years 11 months ago
Simulation Preorder on Simple Process Algebras
We consider the problem of simulation preorder/equivalence between infinite-state processes and finite-state ones. We prove that simulation preorder (in both directions) and simu...
Antonín Kucera, Richard Mayr