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.
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 and Applied Science > Electronics and Computer Science > Web & Internet Science
|Date Deposited:||29 May 2006|
|Last Modified:||02 Mar 2012 11:58|
|Contributors:||Bundgaard, M. (Author)
Sassone, V. (Author)
|Further Information:||Google Scholar|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)