On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus

On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus
复制标题

DOI:
10.1109/lics.2006.39
复制
发表时间:
2006-08
期刊:
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)
影响因子:
--
通讯作者:
C. Palamidessi;V. Saraswat;F. Valencia;B. Victor
C. Palamidessi;V. Saraswat;F. Valencia;B. Victor
中科院分区:
其他
文献类型:
--
作者:
C. Palamidessi;V. Saraswat;F. Valencia;B. Victor

文献摘要

被引文献

相似文献

我们提出了一个线性和持久性的过程的表现力研究。我们选择过程演算的主要代表之一的pi演算作为我们研究的框架。我们考虑pi演算的四个片段。每一个都指出了线性/持久性的自然来源,也存在于其他框架中,如并发约束编程(CCP),线性CCP和几个安全演算。该研究是通过提供(或证明不存在)编码的片段,作为公式的过程解释和减少,明斯基机
We present an expressiveness study of linearity and persistence of processes. We choose the pi-calculus, one of the main representatives of process calculi, as a framework to conduct our study. We consider four fragments of the pi-calculus. Each one singles out a natural source of linearity/persistence also present in other frameworks such as concurrent constraint programming (CCP), linear CCP, and several calculi for security. The study is presented by providing (or proving the non-existence of) encodings among the fragments, a processes-as-formulae interpretation and a reduction from, Minsky machines