Results 1 to 10 of about 678,205 (307)
Matching in the Pi-Calculus [PDF]
We study whether, in the pi-calculus, the match prefix—a conditional operator testing two names for (syntactic) equality—is expressible via the other operators. Previously, Carbone and Maffeis proved that matching is not expressible this way under rather
Kirstin Peters +2 more
doaj +14 more sources
Proof-relevant pi-calculus [PDF]
Formalising the pi-calculus is an illuminating test of the expressiveness of logical frameworks and mechanised metatheory systems, because of the presence of name binding, labelled transitions with name extrusion, bisimulation, and structural congruence.
Roly Perera, James Cheney
doaj +5 more sources
A Stochastic Broadcast Pi-Calculus [PDF]
In this paper we propose a stochastic broadcast PI-calculus which can be used to model server-client based systems where synchronization is always governed by only one participant. Therefore, there is no need to determine the joint synchronization rates.
Lei Song +2 more
doaj +14 more sources
A Fully Abstract Symbolic Semantics for Psi-Calculi [PDF]
We present a symbolic transition system and bisimulation equivalence for psi-calculi, and show that it is fully abstract with respect to bisimulation congruence in the non-symbolic semantics. A psi-calculus is an extension of the pi-calculus with nominal
Magnus Johansson +2 more
doaj +5 more sources
Trees from Functions as Processes [PDF]
Levy-Longo Trees and Bohm Trees are the best known tree structures on the {\lambda}-calculus. We give general conditions under which an encoding of the {\lambda}-calculus into the {\pi}-calculus is sound and complete with respect to such trees.
Davide Sangiorgi, Xian Xu
doaj +7 more sources
Acyclic Solos and Differential Interaction Nets [PDF]
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 equalizing names that are already equal is not required by the encoding of ...
Thomas Ehrhard, Olivier Laurent
doaj +5 more sources
Recursive Session Types Revisited [PDF]
Session types model structured communication-based programming. In particular, binary session types for the pi-calculus describe communication between exactly two participants in a distributed scenario. Adding sessions to the pi-calculus means augmenting
Ornela Dardha
doaj +6 more sources
Translating HOL to Dedukti [PDF]
Dedukti is a logical framework based on the lambda-Pi-calculus modulo rewriting, which extends the lambda-Pi-calculus with rewrite rules. In this paper, we show how to translate the proofs of a family of HOL proof assistants to Dedukti.
Ali Assaf, Guillaume Burel
doaj +12 more sources
Stateful Applied Pi Calculus [PDF]
We extend the applied pi calculus with state cells, which are used to reason about protocols that store persistent information. Examples are protocols involving databases or hardware modules with internal state. We distinguish between private state cells, which are not available to the attacker, and public state cells, which arise when a private state ...
Myrto Arapinis +3 more
semanticscholar +4 more sources
An Intuitive Automated Modelling Interface for Systems Biology [PDF]
We introduce a natural language interface for building stochastic pi calculus models of biological systems. In this language, complex constructs describing biochemical events are built from basic primitives of association, dissociation and transformation.
Ozan Kahramanoğulları +2 more
doaj +6 more sources

