Skip to main content
Journal ArticleOPEN ACCESS

On finite alphabets and infinite bases: From ready pairs to possible worlds

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 2987 182-194
DOI: 10.1007/978-3-540-24727-2_14
9Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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 readiness equivalence and no finer than possible worlds equivalence does not have a finite basis. This semantic range includes ready trace equivalence. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Fokkink, W., & Nain, S. (2004). On finite alphabets and infinite bases: From ready pairs to possible worlds. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2987, 182–194. https://doi.org/10.1007/978-3-540-24727-2_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free