A calculus of mobile processes, II
Information and Computation
From rewrite rules to bisimulation congruences
Theoretical Computer Science
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
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
From Process Calculi to Process Frameworks
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Abstract hierarchical graph transformation
Mathematical Structures in Computer Science
Reflections on the Future of Concurrency Theory in General and Process Calculi in Particular
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
A bigraphical reactive system (BRS) involves bigraphs, in which the nesting of nodes represents locality, independently of the edges connecting them. BRSs represent a wide variety of calculi for mobility, including the 驴-calculus. This short essay explains how bigraphs compose, and uses the 驴-calculus to illustrate how they already provide elements of a unifying theory for calculi of mobile interactive processes.