Technical reports

Axioms for bigraphical structure

Robin Milner

February 2004, 26 pages

DOI: 10.48456/tr-581

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 π-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 the paper demonstrates; this is because bigraphs treat locality and connectivity orthogonally.

Full text

PDF (0.3 MB)

BibTeX record

@TechReport{UCAM-CL-TR-581,
  author =	 {Milner, Robin},
  title = 	 {{Axioms for bigraphical structure}},
  year = 	 2004,
  month = 	 feb,
  url = 	 {https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-581.pdf},
  institution =  {University of Cambridge, Computer Laboratory},
  doi = 	 {10.48456/tr-581},
  number = 	 {UCAM-CL-TR-581}
}