Results 1 to 10 of about 5,002 (241)
Matching in the Pi-Calculus [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 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 +5 more sources
Proof-relevant pi-calculus [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 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 +3 more sources
A Stochastic Broadcast Pi-Calculus [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 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 +8 more sources
The $\pi$-Calculus is Behaviourally Complete and Orbit-Finitely Executable [PDF]
Logical Methods in Computer Science, 2021 Reactive Turing machines extend classical Turing machines with a facility to model observable interactive behaviour. We call a behaviour (finitely) executable if, and only if, it is equivalent to the behaviour of a (finite) reactive Turing machine.
Bas Luttik, Fei Yang
doaj +1 more source
A Fully Abstract Symbolic Semantics for Psi-Calculi [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 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 +1 more source
Non-Deterministic Functions as Non-Deterministic Processes (Extended Version) [PDF]
Logical Methods in Computer Science, 2023 We study encodings of the lambda-calculus into the pi-calculus in the unexplored case of calculi with non-determinism and failures. On the sequential side, we consider lambdafail, a new non-deterministic calculus in which intersection types control ...
Joseph W. N. Paulus +2 more
doaj +1 more source
Psi-calculi: a framework for mobile processes with nominal data and logic [PDF]
Logical Methods in Computer Science, 2011 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.
Jesper Bengtson +3 more
doaj +1 more source
Recursive Session Types Revisited [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 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 +1 more source
Contextual equivalence for higher-order pi-calculus revisited [PDF]
Logical Methods in Computer Science, 2005 The higher-order pi-calculus is an extension of the pi-calculus to allow communication of abstractions of processes rather than names alone. It has been studied intensively by Sangiorgi in his thesis where a characterisation of a contextual equivalence ...
Alan Jeffrey, Julian Rathke
doaj +1 more source
Modules over monads and operational semantics (expanded version) [PDF]
Logical Methods in Computer Science, 2022 This paper is a contribution to the search for efficient and high-level mathematical tools to specify and reason about (abstract) programming languages or calculi.
André Hirschowitz +2 more
doaj +1 more source