A calculus for cryptographic protocols: the spi calculus
Proceedings of the 4th ACM conference on Computer and communications security
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Pure bigraphs: Structure and dynamics
Information and Computation
Reactive systems over directed bigraphs
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |
Bigraphical reactive systemsare an emerging graphical framework proposed by Milner and others [4,5,2,3] as a unifying theory of process models for distributed, concurrent and ubiquitous computing. A bigraphical reactive system consists of a category of bigraphs(usually generated over a given signature of controls) and a set of reaction rules. Bigraphs can be seen as representations of the possible configurations of the system, and the reaction rules specify how these configuration can evolve. The advantage of using bigraphical reactive systems is that they provide general results for deriving a labelled transition system automaticallyfrom the reaction rules, via the so-called IPO construction. Notably, the bisimulation on this transition system is always a congruence.