A CPS encoding of name-passing in higher-order mobile embedded resources

Authors:
Mikkel Bundgaard;Thomas Hildebrandt;Jens Chr. Godskesen
Affiliations:
Department of Theoretical Computer Science, IT University of Copenhagen, Copenhagen, Denmark;Department of Theoretical Computer Science, IT University of Copenhagen, Copenhagen, Denmark;Department of Theoretical Computer Science, IT University of Copenhagen, Copenhagen, Denmark
Venue:
Theoretical Computer Science - Expressiveness in concurrency
Year:
2006

Citing 8
Cited 6

A calculus of mobile processes, II

Information and Computation
A &pgr;-calculus with explicit substitutions

MFCS '94 Selected papers from the 19th international symposium on Mathematical foundations of computer science
Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
Mobile ambients

Theoretical Computer Science
A Calculus of Mobile Resources

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
The Seal Calculus Revisited: Contextual Equivalence and Bisimilarity

FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
On the expressive power of polyadic synchronisation in π-calculus

Nordic Journal of Computing
On the expressiveness of pure safe ambients

Mathematical Structures in Computer Science

Modelling the Security of Smart Cards by Hard and Soft Types for Higher-Order Mobile Embedded Resources

Electronic Notes in Theoretical Computer Science (ENTCS)
Decidable Fragments of a Higher Order Calculus with Locations

Electronic Notes in Theoretical Computer Science (ENTCS)
Bigraphical Semantics of Higher-Order Mobile Embedded Resources with Local Names

Electronic Notes in Theoretical Computer Science (ENTCS)
A model of evolvable components

TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Extending howe's method to early bisimulations for typed mobile embedded resources with local names

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Towards a formal component model for the cloud

SEFM'12 Proceedings of the 10th international conference on Software Engineering and Formal Methods

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an encoding of the synchronous π-calculus in the calculus of Higher-order mobile embedded resources (Homer), a pure higher-order calculus with mobile processes in nested locations, defined as a simple, conservative extension of the core process-passing subset of Thomsen's Plain CHOCS. We prove that our encoding is fully abstract with respect to barbed bisimulation and sound with respect to barbed congruence. Our encoding demonstrates that higher-order process-passing together with mobile resources in, possibly local, named locations are sufficient to express π-calculus name-passing. The encoding uses a novel continuation passing style to facilitate the encoding of synchronous communication.