The various asynchronous π-calculi

For more info about our services contact : help@bestpfe.com

Table of contents

Introduction
Contributions
I Asynchronous communications
1 Concurrent communication models.
1.1 The various π-calculi
1.2 Bisimulations and asynchronous communications
2 Communicating trough buffers
2.1 Buffers, stacks, queues and bags
2.2 The πB-calculus
2.3 Encodings from and to the πa-calculus and πB-calculus
2.4 Impossibility result for the other types of buffer
II Asynchronous behavior
3 Equivalent behavior in the π-calculus
3.1 The late semantics
3.2 Bisimilarities and congruences
3.3 The asynchronous case
4 Causality and asynchrony: speeding up the scheduler
4.1 Bunched Labeled Transition Systems
4.2 Bunched transition system for the πa-calculus
4.3 Further discussions
III Asynchronous probabilistic executions
5 Probabilistic Concurrent Constraint Programming
5.1 The Constraint System
5.2 The language
5.3 Application: Crowds anonymous routing
6 Denotational semantics for the CCP+P
6.1 Valuations
6.2 Vector cones of simple valuations
6.3 Denotational semantics
IV Application: the dinning cryptographers reloaded
7 Anonymous protocols: the dining cryptographer
7.1 The nondeterministic approach to anonymity
7.2 The dining cryptographers’ problem
8 Toward an automated probabilistic anonymity checker
8.1 Probabilistic automata
8.2 Our framework for probabilistic anonymity
8.3 The various notions of anonymity
8.4 Toward an automatic probabilistic checker