Bisimulations for a distributed higher order π-calculus

Authors:
Zining Cao
Affiliations:
Department of Computer Science and Technology, Nanjing University of Aero. & Astro., Nanjing, P. R. China
Venue:
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Year:
2007

Citing 8
Cited 1

Distributed bisimulations

Journal of the ACM (JACM)
Observing localities

Selected papers of the 3rd workshop on Concurrency and compositionality
Bisimulation for higher-order process calculi

Information and Computation
A typed language for distributed mobile processes (extended abstract)

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The m-calculus: a higher-order distributed process calculus

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Locality and True-concurrency in Calculi for Mobile Processes

TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
A Calculus of Mobile Resources

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
The kell calculus: a family of higher-order distributed process calculi

GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing

A logic for distributed higher order π-calculus

TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we design a distributed variant of higher order π-calculus which takes distributed location into account. Furthermore, we present three bisimulations for such a distributed higher order π-calculus, called distributed context bisimulation, distributed normal bisimulation and distributed reduction bisimulation respectively. We prove that the three distributed bisimulations are equivalent.