Bigraphs as a Model for Mobile Interaction
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.
KeywordsLabel Transition System Graph Grammar Mobile Process Reaction Rule Short Essay
Unable to display preview. Download preview PDF.
- 1.Cardelli, L., Gordon, A.D.: Mobile ambients. Foundations of system specification and computational structures, LNCS 1378 (2000) 140–155Google Scholar
- 2.Cattani, G.L., Leifer, J.J., Milner, R.: Contexts and embeddings for closed shallow action graphs. University of Cambridge Computer Laboratory, Technical Report 496 (2000). [Submitted for publication.] Available at http://pauillac.inria.fr/~leifer
- 4.Ehrig, H.: Bigraphs meet double pushouts. To appear in Bulletin of EATCS (2002)Google Scholar
- 5.Gardner, P.A.: From process calculi to process frameworks. Proc. CONCUR 2000, 11th International Conference on Concurrency Theory (2000) 69–88Google Scholar
- 6.Jensen, O.H., Milner, R.: Bigraphs and transitions. Submitted for publication (2002).Google Scholar
- 7.Jensen, O.H., Milner, R.: Forthcoming Technical Report, University of Cambridge Computer Laboratory and Univerity of Aalborg Computer Science Department (2002)Google Scholar
- 8.Leifer, J.J., Milner, R.: Deriving bisimulation congruences for reactive systems. Proc. CONCUR 2000, 11th International Conference on Concurrency theory (2000) 243–258. Available at http://pauillac.inria.fr/~leifer.
- 11.Milner, R.: Bigraphical reactive systems: basic theory. Technical Report 503, University of Cambridge Computer Laboratory (2001). Available from http://www.cl.cam.ac.uk/~rm135.