CORR
2011
Springer
12 years 11 months ago
2011
Springer
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 processe...
ENTCS
2007
13 years 4 months ago
2007
We use the interactive theorem prover Isabelle to prove that the algebraic axiomatization of bisimulation equivalence in the pi-calculus is sound and complete. This is the first ...
ENTCS
2008
13 years 4 months ago
2008
Matching systems were introduced by Carbone and Maffeis, and used to investigate the expressiveness of the pi-calculus with polyadic synchronisation. We adapt their definition and...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We present a restriction of the solos calculus which is stable under reduction and expressive enough to contain an encoding of the pi-calculus. As a consequence, it is shown that ...
FOSSACS
2004
Springer
13 years 10 months ago
2004
Springer
This paper compares the expressiveness of ambient calculi against different dialects of the pi-calculus. Cardelli and Gordon encoded the asynchronous pi-calculus into their calcul...
LICS
2009
IEEE
13 years 11 months ago
2009
IEEE
A psi-calculus is an extension of the pi-calculus with nominal data types for data structures and for logical assertions representing facts about data. These can be transmitted be...