Name Creation Implements Restriction in the π-Calculus
スポンサーリンク
概要
- 論文の詳細を見る
The π-calculus, which is a proposes algebraic model for distributed systems, can describe continual change of linkages between processes. One of interests in π-calculus study is how to implement the π-calculus. For efficient implementation, we use a concept called `fresh name creation' to represent dynamic change of linkages, while conventional theory for the π-calculus uses another concept called `restriction.' This paper gives a formal proof for the equivalence between these concepts.
- 社団法人電子情報通信学会の論文
- 2002-03-01
著者
-
Kawabe Yoshinobu
Ntt Corp. Atsugi‐shi Jpn
-
Kawabe Yoshinobu
Ntt Communication Science Laboratories Ntt Corporation
-
Kogure Kiyoshi
Ntt Communication Science Laboratories Ntt Corporation
-
Mano Ken
NTT Communication Science Labs.
-
Mano Ken
Ntt Communication Science Laboratories Ntt Corporation
-
Mano Ken
Ntt Communication Science Laboratories
-
HORITA Eiichi
NTT Information Sharing Platform Laboratories, NTT Corporation
-
Horita Eiichi
Ntt Information Sharing Platform Laboratories Ntt Corporation
関連論文
- A new proof of Chew's theorem(Theory of Rewriting Systems and Its Applications)
- Termination of Order-Sorted Rewriting with Non-minimal Signatures
- Name Creation Implements Restriction in the π-Calculus
- On Backward-Style Anonymity Verification
- An Adversary Model for Simulation-Based Anonymity Proof
- A Metric Semantics for the $\pi$-Calculus Extended with External Events(Concurrency Theory and Applications '96)
- Verifying Trace Equivalence of a Shared-Memory-Style Communication System(Selected Papers from the 17th Workshop on Circuits and Systems in Karuizawa)
- Real-Time Classification of Human Touching Behaviors Using Pressure Sensors and Its Personal Adaptation
- Modularity of Confluence in Order-Sorted Term Rewriting Systems