On finite alphabets and infinite bases III: Simulation (2006)
by
Taolue Chen
,
Wan Fokkink
| Venue: | Proc. CONCUR’06, LNCS 4137 |
| Citations: | 4 - 1 self |
BibTeX
@INPROCEEDINGS{Chen06onfinite,
author = {Taolue Chen and Wan Fokkink},
title = {On finite alphabets and infinite bases III: Simulation},
booktitle = {Proc. CONCUR’06, LNCS 4137},
year = {2006},
pages = {421--434},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. 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 two actions, the (in)equational theory of BCCSP modulo simulation preorder or equivalence does not have a finite basis. In contrast, in the presence of an alphabet that is infinite or a singleton, the equational theory for simulation equivalence does have a finite basis. 1
