On the Axiomatisability of Parallel Composition

by   Luca Aceto, et al.

This paper studies the existence of finite equational axiomatisations of the interleaving parallel composition operator modulo the behavioural equivalences in van Glabbeek's linear time-branching time spectrum. In the setting of the process algebra BCCSP over a finite set of actions, we provide finite, ground-complete axiomatisations for various simulation and (decorated) trace semantics. We also show that no congruence over BCCSP that includes bisimilarity and is included in possible futures equivalence has a finite, ground-complete axiomatisation; this negative result applies to all the nested trace and nested simulation semantics.


page 1

page 2

page 3

page 4


On the Parallel Composition for True Concurrency

For insight into the parallel composition for true concurrency, we recal...

Failure Trace Semantics for a Process Algebra with Time-outs (preliminary report)

This paper extends a standard process algebra with a time-out operator, ...

On Nested Justification Systems (full version)

Justification theory is a general framework for the definition of semant...

Graded Monads for the Linear Time - Branching Time Spectrum

State-based models of concurrent systems are traditionally considered un...

In search of lost time: Axiomatising parallel composition in process algebras

This survey reviews some of the most recent achievements in the saga of ...

Graded Monads and Behavioural Equivalence Games

The framework of graded semantics uses graded monads to capture behaviou...

Complete trace models of state and control

We consider a hierarchy of four typed call-by-value languages with eithe...