DeepAI
Log In Sign Up

Reactive Bisimulation Semantics for a Process Algebra with Time-Outs

08/26/2020
by   Rob van Glabbeek, et al.
0

This paper introduces the counterpart of strong bisimilarity for labelled transition systems extended with time-out transitions. It supports this concept through a modal characterisation, congruence results for a standard process algebra with recursion, and a complete axiomatisation.

READ FULL TEXT

page 1

page 2

page 3

page 4

12/29/2017

Unifying Theories of Time with Generalised Reactive Processes

Hoare and He's theory of reactive processes provides a unifying foundati...
06/24/2021

Modelling Mutual Exclusion in a Process Algebra with Time-outs

I show that in a standard process algebra extended with time-outs one ca...
08/31/2019

Justness: A Completeness Criterion for Capturing Liveness Properties

This paper poses that transition systems constitute a good model of dist...
06/29/2022

Rate Lifting for Stochastic Process Algebra: Exploiting Structural Properties

This report presents an algorithm for determining the unknown rates in t...
01/29/2020

Extended Algebraic State Transition Diagrams

Algebraic State-Transition Diagrams (ASTDs) are extensions of common aut...
11/04/2019

Generalising KAT to verify weighted computations

Kleene algebra with tests (KAT) was introduced as an algebraic structure...
04/02/2018

On the structure of C-algebras through atomicity and if-then-else

This paper introduces the notions of atoms and atomicity in C-algebras a...