Shallow Linear Action Graphs and their Embeddings

Abstract. Action calculi, which generalise process calculi such as Petri nets, π-calculusand ambient calculus, have been presented in terms of action graphs. We here offer linear action graphs as a primitive basis for action calculi. This paper presents the category of embeddings of undirected linear action graphs without nesting, using a novel form of graphical reasoning which simplifies some otherwise complex manipulations in regular algebra. The results are adapted in a few lines to directed graphs. This work is part of a long-term search for a uniform behavioural theory for process calculi.

[1]  Martín Abadi,et al.  A calculus for cryptographic protocols: the spi calculus , 1997, CCS '97.

[2]  Björn Victor,et al.  The fusion calculus: expressiveness and symmetry in mobile processes , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[3]  Yves Lafont,et al.  Interaction nets , 1989, POPL '90.

[4]  James J. Leifer,et al.  Operational congruences for reactive systems , 2001 .

[5]  R. Milner Calculi for interaction , 1996, Acta Informatica.

[6]  L. Miles,et al.  2000 , 2000, RDH.

[7]  Robin Milner,et al.  Control structures , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[8]  Philippa Gardner,et al.  Explicit Fusions , 2000, MFCS.

[9]  Robin Milner,et al.  Contexts and embeddings for closed shallow action graphs , 2000 .

[10]  Peter Sewell,et al.  From rewrite rules to bisimulation congruences , 2002, Theor. Comput. Sci..

[11]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[12]  Robin Milner,et al.  Deriving Bisimulation Congruences for Reactive Systems , 2000, CONCUR.

[13]  Philippa Gardner,et al.  Symmetric action calculi , 1999 .