Dormancy-aware timed branching bisimilarity

07/19/2021
by   C. A. Middelburg, et al.
0

A variant of the standard notion of branching bisimilarity for processes with discrete relative timing is proposed which is coarser than the standard notion. Using a version of ACP (Algebra of Communicating Processes) with abstraction for processes with discrete relative timing, it is shown that the proposed variant allows of the functional correctness of the PAR (Positive Acknowledgement with Retransmission) protocol as well as its performance properties to be analyzed. In the version of ACP concerned, the difference between the standard notion and its proposed variant is characterized by a single axiom schema.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/05/2017

Truly Concurrent Process Algebra with Timing

We extend truly concurrent process algebra APTC with timing related prop...
research
03/14/2021

Imperative process algebra with abstraction

This paper introduces an imperative process algebra based on ACP (Algebr...
research
09/22/2020

Variant-based Equational Unification under Constructor Symbols

Equational unification of two terms consists of finding a substitution t...
research
11/04/2017

Timing Aware Dummy Metal Fill Methodology

In this paper, we analyzed parasitic coupling capacitance coming from du...
research
12/21/2018

Verification of an industrial asynchronous leader election algorithm using abstractions and parametric model checking

The election of a leader in a network is a challenging task, especially ...
research
04/14/2022

Natural Deduction for Assertibility and Deniability

In this paper we split every basic propositional connective into two ver...
research
06/02/2020

On the Significance of Consecutive Ballots in Paxos

In this paper we examine the Paxos protocol and demonstrate how the disc...

Please sign up or login with your details

Forgot password? Click here to reset