Information and Computation
A calculus of mobile processes, II
Information and Computation
Information Processing Letters
Communication and Concurrency
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From Rewrite to Bisimulation Congruences
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Introduction to the Algebraic Theory of Graph Grammars (A Survey)
Proceedings of the International Workshop on Graph-Grammars and Their Application to Computer Science and Biology
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
BioAmbients: an abstraction for biological compartments
Theoretical Computer Science - Special issue: Computational systems biology
Pure bigraphs: structure and dynamics
Information and Computation
Nordic Journal of Computing - Selected papers of the 17th nordic workshop on programming theory (NWPT'05), October 19-21, 2005
Electronic Notes in Theoretical Computer Science (ENTCS)
An Algebra for Directed Bigraphs
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Static BiLog: a Unifying Language for Spatial Structures
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Systemic computation: A model of interacting systems with natural characteristics
International Journal of Parallel, Emergent and Distributed Systems - Emergent Computation
Designing Biological Computers: Systemic Computation and Sensor Networks
Bio-Inspired Computing and Communication
Trustworthy Global Computing
Pure bigraphs: Structure and dynamics
Information and Computation
Fast bio-inspired computation using a GPU-based systemic computer
Parallel Computing
Static BiLog: a Unifying Language for Spatial Structures
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Hi-index | 0.00 |
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.