19 search results - page 1 / 4 » On Finite Alphabets and Infinite Bases III: Simulation |
CONCUR
2006
Springer
14 years 2 months ago
2006
Springer
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...
FOSSACS
2006
Springer
14 years 2 months ago
2006
Springer
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...
FOSSACS
2004
Springer
14 years 2 months ago
2004
Springer
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...
IANDC
2008
13 years 11 months ago
2008
FOSSACS
2008
Springer
14 years 13 days ago
2008
Springer
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...