Chen, Taolue and Fokkink, W.J. (2006) On finite alphabets and infinite bases III: simulation. In: Baier, C. and Hermanns, H. (eds.) CONCUR 2006: Concurrency Theory: 17th International Conference. Lecture Notes in Computer Science 4137. Springer, pp. 421-434. ISBN 9783540373766.
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.
Metadata
| Item Type: | Book Section |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 09 Feb 2021 18:38 |
| Last Modified: | 09 Aug 2023 12:50 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/42955 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
