Bisimulations Respecting Duration and Causality for the Non-interleaving Applied π-Calculus

09/06/2022
by   Clément Aubert, et al.
0

This paper shows how we can make use of an asynchronous transition system, whose transitions are labelled with events and which is equipped with a notion of independence of events, to define non-interleaving semantics for the applied π-calculus. The most important notions we define are: Start-Termination or ST-bisimilarity, preserving duration of events; and History-Preserving or HP- bisimilarity, preserving causality. We point out that corresponding similarity preorders expose clearly distinctions between these semantics. We draw particular attention to the distinguishing power of HP failure similarity, and discuss how it affects the attacker threat model against which we verify security and privacy properties. We also compare existing notions of located bisimilarity to the definitions we introduce.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/15/2021

Truly Concurrent Calculi with Reversibility, Probabilism and Guards

The well-known process algebras, such as CCS, ACP and π-calculus, captur...
research
01/09/2018

Dynamic Causality in Event Structures

Event Structures (ESs) address the representation of direct relationship...
research
03/24/2022

Lang-n-Send: Processes That Send Languages

We present Lang-n-Send, a pi-calculus that is equipped with language def...
research
08/08/2016

Revisiting Causality Inference in Memory-less Transition Networks

Several methods exist to infer causal networks from massive volumes of o...
research
11/06/2018

A Bisimilarity Congruence for the Applied pi-Calculus Sufficiently Coarse to Verify Privacy Properties

This paper is the first thorough investigation into the coarsest notion ...
research
08/30/2023

A Lean-Congruence Format for EP-Bisimilarity

Enabling preserving bisimilarity is a refinement of strong bisimilarity,...
research
08/23/2019

Conflict vs Causality in Event Structures

Event structures are one of the best known models for concurrency. Many ...

Please sign up or login with your details

Forgot password? Click here to reset