scholarly journals On Unique Decomposition of Processes in the Applied π-Calculus

Author(s):  
Jannik Dreier ◽  
Cristian Ene ◽  
Pascal Lafourcade ◽  
Yassine Lakhnech
2021 ◽  
Vol 43 (2) ◽  
pp. 1-55
Author(s):  
Bernardo Toninho ◽  
Nobuko Yoshida

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.


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

Author(s):  
Roberto M. Amadio ◽  
Gérard Boudol ◽  
Cédric Lhoussaine
Keyword(s):  

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

Author(s):  
Taolue Chen ◽  
Tingting Han ◽  
Jian Lu
Keyword(s):  

2022 ◽  
Vol 14 (2) ◽  
pp. 370
Author(s):  
Cameron Proctor ◽  
Cedelle Pereira ◽  
Tian Jin ◽  
Gloria Lim ◽  
Yuhong He

Efforts to monitor terrestrial decomposition dynamics at broad spatial scales are hampered by the lack of a cost-effective and scalable means to track the decomposition process. Recent advances in remote sensing have enabled the simulation of litter spectra throughout decomposition for grasses in general, yet unique decomposition pathways are hypothesized to create subtly different litter spectral signatures with unique ecosystem functional significance. The objectives of this study were to improve spectra–decomposition linkages and thereby enable the more comprehensive monitoring of ecosystem processes such as nutrient and carbon cycles. Using close-range hyperspectral imaging, litter spectra and multiple decomposition metrics were concurrently monitored in four classes of naturally decayed litter under four decomposition treatments. The first principal component accounted for approximately 94% of spectral variation in the close-range imagery and was attributed to the progression of decomposition. Decomposition-induced spectral changes were moderately correlated with the leaf carbon to nitrogen ratio (R2 = 0.52) and sodium hydroxide extractables (R2 = 0.45) but had no correlation with carbon dioxide flux. Temperature and humidity strongly influenced the decomposition process but did not influence spectral variability or the patterns of surface decomposition. The outcome of the study is that litter spectra are linked to important metrics of decomposition and thus remote sensing could be utilized to assess decomposition dynamics and the implications for nutrient recycling at broad spatial scales. A secondary study outcome is the need to resolve methodological challenges related to inducing unique decomposition pathways in a lab environment. Improving decomposition treatments that mimic real-world conditions of temperature, humidity, insolation, and the decomposer community will enable an improved understanding of the impacts of climatic change, which are expected to strongly affect microbially mediated decomposition.


2018 ◽  
Vol 25 (6) ◽  
pp. 589-606
Author(s):  
Marat M. Abbas ◽  
Vladimir A. Zakharov

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