Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Proof, language, and interaction
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Deriving Bisimulation Congruences for Reactive Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Synchronized Hyperedge Replacement with Name Mobility
CONCUR '01 Proceedings of the 12th 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
Axioms for bigraphical structure
Mathematical Structures in Computer Science
Typed polyadic pi-calculus in bigraphs
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Nordic Journal of Computing - Selected papers of the 17th nordic workshop on programming theory (NWPT'05), October 19-21, 2005
Transition systems, link graphs and Petri nets
Mathematical Structures in Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Pure bigraphs: Structure and dynamics
Information and Computation
Scalable simulation of cellular signaling networks
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Formalising business process execution with bigraphs and reactive XML
COORDINATION'06 Proceedings of the 8th international conference on Coordination Models and Languages
Towards Ontology-Based Formal Verification Methods for Context Aware Systems
Pervasive '09 Proceedings of the 7th International Conference on Pervasive Computing
An algebraic approach to image schemas for geographic space
COSIT'09 Proceedings of the 9th international conference on Spatial information theory
From a community of practice to a body of knowledge: a case study of the formal methods community
FM'11 Proceedings of the 17th international conference on Formal methods
Introduction to special section on formal methods in pervasive computing
ACM Transactions on Autonomous and Adaptive Systems (TAAS) - Special section on formal methods in pervasive computing, pervasive adaptation, and self-adaptive systems: Models and algorithms
Approximate parallel sorting on a spatial computer
Proceedings of the 2012 ACM workshop on Relaxing synchronization for multicore and manycore scalability
Situation Awareness in Applications of Ambient Assisted Living for Cognitive Impaired People
Mobile Networks and Applications
Towards formalising installation and reconfiguration tasks of AADL architecture
International Journal of Communication Networks and Distributed Systems
Model-Driven Approaches to Service Composition
International Journal of Adaptive, Resilient and Autonomic Systems
| Hi-index | 0.01 |
Bigraphs are a framework in which both existing process calculi and new models of behaviour can be formulated, yielding theory that is shared among these models. A short survey of the main features of bigraphs is presented, showing how they can be developed from standard graph theory using elementary category theory. The algebraic manipulation of bigraphs is outlined with the help of illustrations. The treatment of dynamics is then summarised. Finally, origins and some related work are discussed. The paper provides a motivating introduction to bigraphs.