On the reduction of chocs bisimulation to π-calculus bisimulation-Reference-Cited by-同舟云学术

On the reduction of chocs bisimulation to π-calculus bisimulation

Published:1993 Issue: Volume: Page:112-126
ISSN:0302-9743
Container-title:CONCUR'93
language:
Short-container-title:

Author:

Amadio Roberto M.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-57208-2_9.pdf

Reference11 articles.

1. S. Abramsky. A domain equation for bisimulation. Information and Computation, 92:161–218, 1991.

2. O. Aït Mohamed. Machines à environnement et π-calcul. Centre de Recherche en Informatique de Nancy, September 1992. Mémoire de DEA.

3. R. Amadio. A uniform presentation of chocs and π-calculus. Research Report 1726, Inria-Lorraine, 1992.

4. G. Boudol. Towards a lambda calculus for concurrent and communicating systems. SLNCS, 351, 1989. In Proc. TAPSOFT.

5. U. Engberg and M. Nielsen. A calculus of communicating systems with label passing. Technical report, DAIMI PB-208, Computer Science Department, Aarhus, Denmark, 1986.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi;Automata, Languages and Programming;2010

2. First–order Semantics for Higher–order Processes;Electronic Notes in Theoretical Computer Science;2001-11

3. Seal: A Framework for Secure Mobile Computations;Internet Programming Languages;1999

4. Modal characterization of weak bisimulation for higher-order processes;TAPSOFT '97: Theory and Practice of Software Development;1997

5. Mechanizing a π-calculus equivalence in HOL;Higher Order Logic Theorem Proving and Its Applications;1995