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

research
12/29/2017

Unifying Theories of Time with Generalised Reactive Processes

Hoare and He's theory of reactive processes provides a unifying foundati...
research
06/29/2022

Rate Lifting for Stochastic Process Algebra: Exploiting Structural Properties

This report presents an algorithm for determining the unknown rates in t...
research
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...
research
01/29/2020

Extended Algebraic State Transition Diagrams

Algebraic State-Transition Diagrams (ASTDs) are extensions of common aut...
research
12/17/2022

Just Testing

The concept of must testing is naturally parametrised with a chosen comp...
research
08/31/2019

Justness: A Completeness Criterion for Capturing Liveness Properties

This paper poses that transition systems constitute a good model of dist...
research
08/19/2019

Divide and Congruence III: From Decomposition of Modal Formulas to Preservation of Stability and Divergence

In two earlier papers we derived congruence formats with regard to trans...

Please sign up or login with your details

Forgot password? Click here to reset