A symbolic semantics for the π-calculus — Extended abstract

2005 ◽  
pp. 299-314 ◽  
Author(s):  
Michele Boreale ◽  
Rocco Nicola
Keyword(s):  
Π Calculus

scholarly journals On Polymorphic Sessions and Functions

2021 ◽  
Vol 43 (2) ◽  
pp. 1-55
Author(s):  
Bernardo Toninho ◽  
Nobuko Yoshida
Keyword(s):  
Natural Deduction ◽  
Sequent Calculus ◽  
Linear Logic ◽  
Linear Formulation ◽  
Session Types ◽  
Logical Foundation ◽  
Π Calculus ◽  
Soundness And Completeness ◽  
System F ◽  
Algebraic Representations

This work exploits the logical foundation of session types to determine what kind of type discipline for the Λ-calculus can exactly capture, and is captured by, Λ-calculus behaviours. Leveraging the proof theoretic content of the soundness and completeness of sequent calculus and natural deduction presentations of linear logic, we develop the first mutually inverse and fully abstract processes-as-functions and functions-as-processes encodings between a polymorphic session π-calculus and a linear formulation of System F. We are then able to derive results of the session calculus from the theory of the Λ-calculus: (1) we obtain a characterisation of inductive and coinductive session types via their algebraic representations in System F; and (2) we extend our results to account for value and process passing, entailing strong normalisation.

Symbolic transition graph and its early bisimulation checking algorithms for the π-calculus

1999 ◽  
Vol 42 (4) ◽  
pp. 342-353 ◽  
Author(s):  
Zhoujun Li ◽  
Huowang Chen ◽  
Bingshan Wang
Keyword(s):  
Transition Graph ◽  
Π Calculus

The Receptive Distributed π-Calculus

1999 ◽  
pp. 304-315 ◽  
Author(s):  
Roberto M. Amadio ◽  
Gérard Boudol ◽  
Cédric Lhoussaine
Keyword(s):  
Π Calculus

Petri nets semantics of π-calculus

2008 ◽  
Vol 3 (3) ◽  
pp. 290-294
Author(s):  
Zhenhua Yu ◽  
Yuanli Cai ◽  
Haiping Xu
Keyword(s):  
Petri Nets ◽  
Π Calculus

Symbolic Semantics for Weak Open Bisimulation in π-calculus 1

2019 ◽  
pp. 24-27
Author(s):  
Taolue Chen ◽  
Tingting Han ◽  
Jian Lu
Keyword(s):  
Π Calculus

scholarly journals Even Simple Processes of π-calculus are Hard for Analysis

2018 ◽  
Vol 25 (6) ◽  
pp. 589-606
Author(s):  
Marat M. Abbas ◽  
Vladimir A. Zakharov
Keyword(s):  
Information Security ◽  
Mathematical Models ◽  
Cryptographic Protocols ◽  
Bounded Number ◽  
Distributed Computations ◽  
Security Properties ◽  
Mobile Processes ◽  
Π Calculus ◽  
Np Complete ◽  
Turing Complete

Mathematical models of distributed computations, based on the calculus of mobile processes (π-calculus) are widely used for checking the information security properties of cryptographic protocols. Since π-calculus is Turing-complete, this problem is undecidable in general case. Therefore, the study is carried out only for some special classes of π-calculus processes with restricted computational capabilities, for example, for non-recursive processes, in which all runs have a bounded length, for processes with a bounded number of parallel components, etc. However, even in these cases, the proposed checking procedures are time consuming. We assume that this is due to the very nature of the π -calculus processes. The goal of this paper is to show that even for the weakest model of passive adversary and for relatively simple protocols that use only the basic π-calculus operations, the task of checking the information security properties of these protocols is co-NP-complete.

Sign in / Sign up

Export Citation Format

Share Document