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

Authors:
Taolue Chen;Wan Fokkink;Sumit Nain
Affiliations:
-;Department of Software Engineering, CWI, Amsterdam, The Netherlands;Department of Computer Science, Rice University, Houston, TX
Venue:
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Year:
2006

Citing 8
Cited 3

A new strategy for proving &ohgr;-completeness applied to process algebra

CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
PAM: a process algebra manipulator

Formal Methods in System Design
Communication and Concurrency

Communication and Concurrency
An omega-Complete Equational Specification of Interleaving

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
The Linear Time - Branching Time Spectrum II

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Nested semantics over finite trees are equationally hard

Information and Computation
On the axiomatizability of ready traces, ready simulation, and failure traces

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A finite basis for failure semantics

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

On finite alphabets and infinite bases

Information and Computation
Ready to preorder: get your BCCSP axiomatization for free!

CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
On finite alphabets and infinite bases III: simulation

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory

Quantified Score

Hi-index	0.01

Visualization

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.