Bengtson, Jesper and Johansson, Magnus and Parrow, Joachim and Victor, Björn - Psi-calculi: a framework for mobile processes with nominal data and logic

lmcs:696 - Logical Methods in Computer Science, March 29, 2011, Volume 7, Issue 1
Psi-calculi: a framework for mobile processes with nominal data and logic

Authors: Bengtson, Jesper and Johansson, Magnus and Parrow, Joachim and Victor, Björn

The framework of psi-calculi extends the pi-calculus with nominal datatypes for data structures and for logical assertions and conditions. These can be transmitted between processes and their names can be statically scoped as in the standard pi-calculus. Psi-calculi can capture the same phenomena as other proposed extensions of the pi-calculus such as the applied pi-calculus, the spi-calculus, the fusion calculus, the concurrent constraint pi-calculus, and calculi with polyadic communication channels or pattern matching. Psi-calculi can be even more general, for example by allowing structured channels, higher-order formalisms such as the lambda calculus for data structures, and predicate logic for assertions. We provide ample comparisons to related calculi and discuss a few significant applications. Our labelled operational semantics and definition of bisimulation is straightforward, without a structural congruence. We establish minimal requirements on the nominal data and logic in order to prove general algebraic properties of psi-calculi, all of which have been checked in the interactive theorem prover Isabelle. Expressiveness of psi-calculi significantly exceeds that of other formalisms, while the purity of the semantics is on par with the original pi-calculus.


Source : oai:arXiv.org:1101.3262
DOI : 10.2168/LMCS-7(1:11)2011
Volume: Volume 7, Issue 1
Published on: March 29, 2011
Submitted on: December 30, 2009
Keywords: Computer Science - Logic in Computer Science,F.1.2, F.3.1, F.3.2


Share

Consultation statistics

This page has been seen 85 times.
This article's PDF has been downloaded 31 times.