Abstract
Bigraphical reactive systems are 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 automatically from the reaction rules, via the so-called IPO construction. Notably, the bisimulation on this transition system is always a congruence.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Abadi, M., Gordon, A.D.: A Calculus for Cryptographic Protocols: The Spi Calculus. In: ACM Conference on Computer and Communications Security (1997)
Grohmann, D., Miculan, M.: Directed bigraphs. In Proc. XXIII MFPS. Electronic Notes in Theoretical Computer Science, vol. 173. Elsevier, Amsterdam (2007)
Grohmann, D., Miculan, M.: Reactive systems over directed bigraphs. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703. Springer, Heidelberg (2007)
Milner, R.: Bigraphical reactive systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154. Springer, Heidelberg (2001)
Milner, R.: Pure bigraphs: Structure and dynamics. Information and Computation 204(1), 60–122 (2006)
Parrow, J., Victor, B.: The fusion calculus: Expressiveness and symmetry in mobile processes. In: Proceedings of LICS 1998. IEEE Computer Society Press, Los Alamitos (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grohmann, D. (2008). Security, Cryptography and Directed Bigraphs. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds) Graph Transformations. ICGT 2008. Lecture Notes in Computer Science, vol 5214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87405-8_41
Download citation
DOI: https://doi.org/10.1007/978-3-540-87405-8_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87404-1
Online ISBN: 978-3-540-87405-8
eBook Packages: Computer ScienceComputer Science (R0)