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

research
02/22/2021

On the Axiomatisability of Parallel Composition

This paper studies the existence of finite equational axiomatisations of...
research
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...
research
09/18/2023

𝔽-valued trace of a finite-dimensional commutative 𝔽-algebra

A non-zero 𝔽-valued 𝔽-linear map on a finite dimensional 𝔽-algebra is ca...
research
01/12/2018

Desingularization in the q-Weyl algebra

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

Weihrauch goes Brouwerian

We prove that the Weihrauch lattice can be transformed into a Brouwer al...
research
03/28/2023

On Causal Equivalence by Tracing in String Rewriting

We introduce proof terms for string rewrite systems and, using these, sh...
research
03/14/2021

Imperative process algebra with abstraction

This paper introduces an imperative process algebra based on ACP (Algebr...

Please sign up or login with your details

Forgot password? Click here to reset