BIROn - Birkbeck Institutional Research Online

On finite alphabets and infinite bases II: completed and ready simulation

Chen, Taolue and Fokkink, W.J. and Nain, S. (2006) On finite alphabets and infinite bases II: completed and ready simulation. In: Aceto, L. and Ingolfsdottir, A. (eds.) Foundations of Software Science and Computation Structures, 9th International Conference, {FOSSACS} 2006. Springer, pp. 1-15. ISBN 9783540330455.

Full text not available from this repository.

Abstract

We prove that the equational theory of the process algebra BCCSP modulo completed simulation equivalence does not have a finite basis. Furhermore, we prove that with a finite alphabet of actions, the equational theory of BCCSP modulo ready simulation equivalence does not have a finite basis. In contrast, with an infinite alphabet, the latter equational theory 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 19:05
Last Modified: 09 Aug 2023 12:50
URI: https://eprints.bbk.ac.uk/id/eprint/42956

Statistics

6 month trend
0Downloads
6 month trend
208Hits

Additional statistics are available via IRStats2.

Archive Staff Only (login required)

Edit/View Item
Edit/View Item