The equational theory of weak complete simulation semantics over BCCSP

Authors:
Luca Aceto;David de Frutos-Escrig;Carlos Gregorio-Rodríguez;Anna Ingólfsdóttir
Affiliations:
ICE-TCS, School of Computer Science, Reykjavik University, Iceland;Departamento de Sistemas Informáticos y Computación, Universidad Complutense de Madrid, Spain;Departamento de Sistemas Informáticos y Computación, Universidad Complutense de Madrid, Spain;ICE-TCS, School of Computer Science, Reykjavik University, Iceland
Venue:
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Year:
2012

Citing 16
Cited 0

Algebraic laws for nondeterminism and concurrency

Journal of the ACM (JACM)
Communicating sequential processes

Communicating sequential processes
A complete axiomatisation for observational congruence of finite-state behaviours

Information and Computation
Bisimulation through probabilistic testing

Information and Computation
Turning SOS rules into equations

Information and Computation
Bisimulation can't be traced

Journal of the ACM (JACM)
Communication and Concurrency

Communication and Concurrency
Axiomatisations of Weak Equivalences for De Simone Languages

CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences

Proceedings of the 5th GI-Conference on Theoretical Computer Science
On finite alphabets and infinite bases

Information and Computation
On the Unification of Process Semantics: Equational Semantics

Electronic Notes in Theoretical Computer Science (ENTCS)
An algebraic definition of simulation between programs

IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Process Algebra: Equational Theories of Communicating Processes

Process Algebra: Equational Theories of Communicating Processes
Lifting non-finite axiomatizability results to extensions of process algebras

Acta Informatica
Axiomatizing weak ready simulation semantics over BCCSP

ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Finite equational bases in process algebra: results and open questions

Processes, Terms and Cycles

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a complete account of positive and negative results on the finite axiomatizability of weak complete simulation semantics over the language BCCSP. We offer finite (un)conditional ground-complete axiomatizations for the weak complete simulation precongruence. In sharp contrast to this positive result, we prove that, in the presence of at least one observable action, the (in)equational theory of the weak complete simulation precongruence over BCCSP does not have a finite (in)equational basis. In fact, the set of (in)equations in at most one variable that hold in weak complete simulation semantics over BCCSP does not have an (in)equational basis of ‘bounded depth', let alone a finite one.