Axioms for bigraphical structure

Robin Milner

Research output: Contribution to journalArticlepeer-review

Abstract

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.
Original languageEnglish
Pages (from-to)1005-1032
Number of pages28
JournalMathematical Structures in Computer Science
Volume15
Issue number6
DOIs
Publication statusPublished - 2005

Fingerprint

Dive into the research topics of 'Axioms for bigraphical structure'. Together they form a unique fingerprint.

Cite this