Bigraphical Semantics of Higher-Order Mobile Embedded Resources with Local Names

Authors:
Mikkel Bundgaard;Thomas Hildebrandt
Affiliations:
Programming, Logic, and Semantics Group, IT University of Copenhagen, Denmark;Programming, Logic, and Semantics Group, IT University of Copenhagen, Denmark
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2006

Citing 5
Cited 6

A &pgr;-calculus with explicit substitutions

MFCS '94 Selected papers from the 19th international symposium on Mathematical foundations of computer science
Bigraphs and transitions

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the expressive power of polyadic synchronisation in π-calculus

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

Theoretical Computer Science - Expressiveness in concurrency
The Seal Calculus

Information and Computation

Local Bigraphs and Confluence: Two Conjectures

Electronic Notes in Theoretical Computer Science (ENTCS)
Modelling the Security of Smart Cards by Hard and Soft Types for Higher-Order Mobile Embedded Resources

Electronic Notes in Theoretical Computer Science (ENTCS)
On the Construction of Sorted Reactive Systems

CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Type Systems for Bigraphs

Trustworthy Global Computing
Formalizing higher-order mobile embedded business processes with binding bigraphs

COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
Sortings for reactive systems

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bigraphs have been introduced with the aim to provide a topographical meta-model for mobile, distributed agents that can manipulate their own linkages and nested locations, generalising both characteristics of the @p-calculus and the Mobile Ambients calculus. We give the first bigraphical presentation of a non-linear, higher-order process calculus with nested locations, non-linear active process mobility, and local names, the calculus of Higher-Order Mobile Embedded Resources (Homer). The presentation is based on Milner's recent presentation of the @l-calculus in local bigraphs. The combination of non-linear active process mobility and local names requires a new definition of parametric reaction rules and a representation of the location of names. We suggest localised bigraphs as a generalisation of local bigraphs in which links can be further localised.