Abstract
A notion of bigraph is introduced as a model of mobile interaction. A bigraph consists of two independent structures: a topograph representing locality and an edge net representing connectivity. Bigraphs arc equipped with reaction rules to form bigraphical reactive systems (BRSs), which include versions of the π-calculus and the ambient calculus. A behavioural theory is established, using the categorical notion of relative pushout; it allows labelled transition systems to be derived uniformly for a wide variety of BRSs, in such a way that familiar behavioural prcordcrs and equivalences, in particular bisimilarity, are congruential. An example of the derivation is discussed.
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
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Berry, G. and Boudol, G. (1992), The chemical abstract machine. Journal of Theoretical Computer Science, Vol 96, pp217 248.
Cardclli, L. and Gordon, A.D. (2000), Mobile ambicnts. Foundations of System Specification and Computational Structures, LNCS 1378, pp140–155.
Cattani, G.L., Lcifcr, J.J. and Milncr, R. (2000), Contexts and Embcddings for closed shallow action graphs. University of Cambridge Computer Laboratory, Technical Report 496. [Submitted for publication.] Available at http://www.cam.cl.ac.uk/users/jjl21.
Gardner, P.A. (2000), From process calculi to process frameworks. Proc. CON-CUR 2000, 11th International Conference on Concurrency theory, pp69–88.
Gardner, P.A. and Wischik, L. (2000), Explicit fusions. Proc. MFCS 2000. LNCS 1893, pp373–383.
Hasegawa, M. (1999) Models of sharing graphs. Distinguished Dissertation Series, Springer-Verlag.
Lafont, Y. (1990), Interaction nets. Proc. 17th ACM Symposium on Principles of Programming Languages (POPL 90), pp95–108.
Leiter, J.J. (2001), Operational congruences for reactive systems. PhD Dissertation, University of Cambridge Computer Laboratory.
Leiter, J.J. and Millier, R. (2000), Deriving bisimulation congruences for reactive systems. Proc. CONCUR 2000, 11th International Conference on Concurrency theory, pp243–258. Available at http://www.cam.cl.ac.uk/users/jjl21.
Milner, R. (1996), Calculi for interaction. Acta Informatica 33, pp707–737.
Milner, R. (2001), Digraphs. Forthcoming Technical Report, University of Cambridge Computer Laboratory.
Milncr, R., Parrow, J. and Walker D. (1992), A calculus of mobile processes. Parts I and II. Journal of Information and Computation, Vol 100, pp1–40 arid pp41–77.
Parrow, J. and Victor, B. (1998), The fusion calculus: expressiveness and symmetry in mobile processes. Proc. LICS’98, IEEE Computer Society Press.
Pctri, C.A. (1962), Fundamentals of a theory of asynchronous information flow. Proc. IFIP Congress’ 62, North Holland, pp386–390.
Scwcll, P. (1998), From rewrite rules to bisimulation congruences. Proc CON-CUR’98, LNCS 1466, pp269 284. Full version to appear in Theoretical Computer Science, Vol 272/1-2.
Wojciechowski, P.T. and Sewell, P. (1999), Nomadic Pict: Language and infrastructure design for mobile agents. Proc. ASA/MA’ 99, Palm Springs, California.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Milner, R. (2001). Bigraphical Reactive Systems. In: Larsen, K.G., Nielsen, M. (eds) CONCUR 2001 — Concurrency Theory. CONCUR 2001. Lecture Notes in Computer Science, vol 2154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44685-0_2
Download citation
DOI: https://doi.org/10.1007/3-540-44685-0_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42497-0
Online ISBN: 978-3-540-44685-9
eBook Packages: Springer Book Archive