Hostname: page-component-745bb68f8f-5r2nc Total loading time: 0 Render date: 2025-02-11T02:33:35.369Z Has data issue: false hasContentIssue false
  • English
  • Français

Axioms for bigraphical structure

Published online by Cambridge University Press:  08 December 2005

ROBIN MILNER
ROBIN MILNER
Affiliation:
University of Cambridge, The Computer Laboratory, J J Thomson Avenue, Cambridge CB3 0FD, UK
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

This paper axiomatises the structure of bigraphs, and proves that the resulting theory is complete. Bigraphs are graphs with double structure, representing locality and connectivity. They have been shown to represent dynamic theories for the $\pi$-calculus, mobile ambients and Petri nets in a way that is faithful to each of those models of discrete behaviour. While the main purpose of bigraphs is to understand mobile systems, a prerequisite for this understanding is a well-behaved theory of the structure of states in such systems. The algebra of bigraph structure is surprisingly simple, as this paper demonstrates; this is because bigraphs treat locality and connectivity orthogonally.

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 15 , Issue 6 , December 2005 , pp. 1005 - 1032
Copyright
2005 Cambridge University Press