A Compositional Semantics for the Reversible p-Calculus

Authors:
Ioana Cristescu;Jean Krivine;Daniele Varacca
Affiliations:
-;-;-
Venue:
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Year:
2013

Citing 15
Cited 0

On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes

Acta Informatica
Back and forth bisimulations

CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Non-interleaving semantics for mobile processes

Theoretical Computer Science
Causal Trees

ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Deriving Bisimulation Congruences for Reactive Systems

CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Confidentiality Analysis of Mobile Systems

SAS '00 Proceedings of the 7th International Symposium on Static Analysis
Permutation of transitions: An event structure semantics for CCS and SCCS

Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Comparing the expressive power of the synchronous and asynchronous $pi$-calculi

Mathematical Structures in Computer Science
Transactions in RCCS

CONCUR 2005 - Concurrency Theory
Reversibility and Models for Concurrency

Electronic Notes in Theoretical Computer Science (ENTCS)
Finitely Branching Labelled Transition Systems from Reaction Semantics for Process Calculi

Recent Trends in Algebraic Development Techniques
Irreversibility and heat generation in the computing process

IBM Journal of Research and Development
Reversing higher-order pi

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Reversing algebraic process calculi

FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Event structure semantics of parallel extrusion in the pi-calculus

FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a labelled transition semantics for the reversible p-calculus. It is the first account of a compositional definition of a reversible calculus, that has both concurrency primitives and name mobility. The notion of reversibility is strictly linked to the notion of causality. We discuss the notion of causality induced by our calculus, and we compare it with the existing notions in the literature, in particular for what concerns the syntactic feature of scope extrusion, typical of the p-calculus.