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

02/25/2020
by   Rob van Glabbeek, et al.
0

This paper extends a standard process algebra with a time-out operator, thereby increasing its absolute expressiveness, while remaining within the realm of untimed process algebra, in the sense that the progress of time is not quantified. Trace and failures equivalence fail to be congruences for this operator; their congruence closure is characterised as failure trace equivalence.

READ FULL TEXT

page 1

page 2

page 3

page 4

02/22/2021

On the Axiomatisability of Parallel Composition

This paper studies the existence of finite equational axiomatisations of...
09/14/2017

Trace and Stable Failures Semantics for CSP-Agda

CSP-Agda is a library, which formalises the process algebra CSP in the i...
01/12/2018

Desingularization in the q-Weyl algebra

In this paper, we study the desingularization problem in the first q-Wey...
09/02/2018

Weihrauch goes Brouwerian

We prove that the Weihrauch lattice can be transformed into a Brouwer al...
03/09/2019

Trace Equivalence and Epistemic Logic to Express Security Properties

In process algebras, security properties are expressed as equivalences b...
03/04/2019

Differentiable Causal Computations via Delayed Trace

We investigate causal computations taking sequences of inputs to sequenc...
03/29/2022

Graded Monads and Behavioural Equivalence Games

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