The University of Southampton
University of Southampton Institutional Repository

Typed polyadic pi-calculus in bigraphs

Typed polyadic pi-calculus in bigraphs
Typed polyadic pi-calculus in bigraphs
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 pi-calculus with capability types à 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) pi-calculus as sortings in the setting of bigraphs.
bigraphs, typed polyadic pi-calculus, sortings, subsorting, bisimulation congruences, relative pushouts
1-12
Bundgaard, M.
6c758bf7-d69d-4ee3-8df5-169dd533d883
Sassone, V.
df7d3c83-2aa0-4571-be94-9473b07b03e7
Bundgaard, M.
6c758bf7-d69d-4ee3-8df5-169dd533d883
Sassone, V.
df7d3c83-2aa0-4571-be94-9473b07b03e7

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

Record type: Conference or Workshop Item (Paper)

Abstract

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 pi-calculus with capability types à 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) pi-calculus as sortings in the setting of bigraphs.

Text
tpcPPDPoff.pdf - Other
Download (248kB)

More information

Published date: 2006
Venue - Dates: 8th Symposium on Principles ad Practice of Declarative Programming, PPDP'06, , Venice, Italy, 2006-07-10
Keywords: bigraphs, typed polyadic pi-calculus, sortings, subsorting, bisimulation congruences, relative pushouts
Organisations: Web & Internet Science

Identifiers

Local EPrints ID: 262647
URI: http://eprints.soton.ac.uk/id/eprint/262647
PURE UUID: dfd8a991-ea06-414d-8852-b632a9394fdc

Catalogue record

Date deposited: 29 May 2006
Last modified: 14 Mar 2024 07:15

Export record

Contributors

Author: M. Bundgaard
Author: V. Sassone

Download statistics

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×