Bigraphical Reactive Systems
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.
Unable to display preview. Download preview PDF.
- Cardclli, L. and Gordon, A.D. (2000), Mobile ambicnts. Foundations of System Specification and Computational Structures, LNCS 1378, pp140–155.Google Scholar
- 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.Google Scholar
- Gardner, P.A. and Wischik, L. (2000), Explicit fusions. Proc. MFCS 2000. LNCS 1893, pp373–383.Google Scholar
- Hasegawa, M. (1999) Models of sharing graphs. Distinguished Dissertation Series, Springer-Verlag.Google Scholar
- Lafont, Y. (1990), Interaction nets. Proc. 17th ACM Symposium on Principles of Programming Languages (POPL 90), pp95–108.Google Scholar
- Leiter, J.J. (2001), Operational congruences for reactive systems. PhD Dissertation, University of Cambridge Computer Laboratory.Google Scholar
- 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. (2001), Digraphs. Forthcoming Technical Report, University of Cambridge Computer Laboratory.Google Scholar
- Parrow, J. and Victor, B. (1998), The fusion calculus: expressiveness and symmetry in mobile processes. Proc. LICS’98, IEEE Computer Society Press.Google Scholar
- Pctri, C.A. (1962), Fundamentals of a theory of asynchronous information flow. Proc. IFIP Congress’ 62, North Holland, pp386–390.Google Scholar
- 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.Google Scholar
- Wojciechowski, P.T. and Sewell, P. (1999), Nomadic Pict: Language and infrastructure design for mobile agents. Proc. ASA/MA’ 99, Palm Springs, California.Google Scholar