Results 31 to 40 of about 5,002 (241)
Reversible session-based pi-calculus
Journal of Logical and Algebraic Methods in Programming, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
TIEZZI, Francesco, Yoshida, Nobuko
openaire +5 more sources
Hide and New in the Pi-Calculus [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 In this paper, we enrich the pi-calculus with an operator for confidentiality (hide), whose main effect is to restrict the access to the object of the communication, thus representing confidentiality in a natural way. The hide operator is meant for local
Marco Giunti +2 more
doaj +1 more source
Stochastic Pi-calculus Revisited [PDF]
, 2013 We develop a version of stochastic Pi-calculus with a semantics based on measure theory. We define the behaviour of a process in a rate environment using measures over the measurable space of processes induced by structural congruence. We extend the stochastic bisimulation to include the concept of rate environment and prove that this equivalence is a ...
Luca Cardelli, Radu Mardare
openaire +2 more sources
Privacy by typing in the $\pi$-calculus [PDF]
Logical Methods in Computer Science, 2017 In this paper we propose a formal framework for studying privacy in information systems. The proposal follows a two-axes schema where the first axis considers privacy as a taxonomy of rights and the second axis involves the ways an information system ...
Dimitrios Kouzapas, Anna Philippou
doaj +1 more source
Formalising the pi-calculus using nominal logic [PDF]
Logical Methods in Computer Science, 2009 We formalise the pi-calculus using the nominal datatype package, based on ideas from the nominal logic by Pitts et al., and demonstrate an implementation in Isabelle/HOL.
Jesper Bengtson, Joachim Parrow
doaj +1 more source
Termination in a Pi-calculus with Subtyping [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 We present a type system to guarantee termination of pi-calculus processes that exploits input/output capabilities and subtyping, as originally introduced by Pierce and Sangiorgi, in order to analyse the usage of channels.
Daniel Hirschkoff, Ioana Cristescu
doaj +1 more source
Unique Parallel Decomposition for the Pi-calculus [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 A (fragment of a) process algebra satisfies unique parallel decomposition if the definable behaviours admit a unique decomposition into indecomposable parallel components. In this paper we prove that finite processes of the pi-calculus, i.e.
Matias David Lee, Bas Luttik
doaj +1 more source
A criterion for separating process calculi [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 We introduce a new criterion, replacement freeness, to discern the relative expressiveness of process calculi. Intuitively, a calculus is strongly replacement free if replacing, within an enclosing context, a process that cannot perform any visible ...
Federico Banti +2 more
doaj +1 more source
On the Distributability of Mobile Ambients [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 Modern society is dependent on distributed software systems and to verify them different modelling languages such as mobile ambients were developed. To analyse the quality of mobile ambients as a good foundational model for distributed computation, we ...
Kirstin Peters, Uwe Nestmann
doaj +1 more source
Towards Races in Linear Logic [PDF]
Logical Methods in Computer Science, 2020 Process calculi based in logic, such as $\pi$DILL and CP, provide a foundation for deadlock-free concurrent programming, but exclude non-determinism and races.
Wen Kokke +2 more
doaj +1 more source