Typed polyadic pi-calculus in bigraphs

Bundgaard, M. and Sassone, V. (2006) Typed polyadic pi-calculus in bigraphs. In, 8th Symposium on Principles ad Practice of Declarative Programming, PPDP'06 ACM Press, 1-12.


[img] PDF
Download (242Kb)


Bigraphs have been introduced with the aim to provide a topographical meta-model for mobile, distributed agents that can manipulate their own communication links and nested locations. In this paper we examine a presentation of type systems on bigraphical systems using the notion of sorting. We focus our attention on the typed polyadic ?-calculus with capability types `a la Pierce and Sangiorgi, which we represent using a novel kind of link sorting called subsorting. Using the theory of relative pushouts we derive a labelled transition system which yield a coinductive characterisation of a behavioural congruence for the calculus. The results obtained in this paper constitute a promising foundation for the presentation of various type systems for the (polyadic) ?-calculus as sortings in the setting of bigraphs.

Item Type: Conference or Workshop Item (Paper)
Keywords: bigraphs, typed polyadic pi-calculus, sortings, subsorting, bisimulation congruences, relative pushouts
Divisions : Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Web & Internet Science
ePrint ID: 262647
Accepted Date and Publication Date:
Date Deposited: 29 May 2006
Last Modified: 31 Mar 2016 14:06
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/262647

Actions (login required)

View Item View Item

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics