Contexts and embeddings for closed shallow action graphs

作者: James J. Leifer , Robin Milner , Gian Luca Cattani

DOI:

关键词:

摘要: Action calculi, which have a graphical presentation, were introduced to develop theory shared among different calculi for interactive systems. The -calculus, the Petri nets, Ambient calculus and others may all be represented as action calculi. This paper develops part of theory. A recent by two authors was concerned with notion reactive system, essentially category process contexts whose behaviour is presented reduction relation. It shown that one can, any uniformly derive labelled transition system associated behavioural equivalence relations (e.g. trace or bisimilarity) will congruential, under condition certain relative pushouts exist in system. In present we treat closed, shallow (those no free names nested actions) generic application these results. We define graphs embeddings, closely linked forms connection independent interest; it also serves our purpose, enables us demonstrate appropriate exist. Complemented work reported elsewhere, this demonstration yields systems congruences substantial class regard step towards comparable results full class.

参考文章(18)
Andrea Corradini, Ugo Montanari, An Algebra of Graphs and Graph Rewriting Proceedings of the 4th International Conference on Category Theory and Computer Science. pp. 236- 260 ,(1991) , 10.1007/BFB0013469
James J. Leifer, Robin Milner, Deriving Bisimulation Congruences for Reactive Systems international conference on concurrency theory. pp. 243- 258 ,(2000) , 10.1007/3-540-44618-4_19
Hartmut Ehrig, Introduction to the Algebraic Theory of Graph Grammars (A Survey) international workshop on graph grammars and their application to computer science. pp. 1- 69 ,(1978) , 10.1007/BFB0025714
Kohei Honda, Mario Tokoro, An Object Calculus for Asynchronous Communication european conference on object oriented programming. pp. 133- 147 ,(1991) , 10.1007/BFB0057019
Zena M. Ariola, Jan Willem Klop, Equational term graph rewriting Fundamenta Informaticae. ,vol. 26, pp. 207- 240 ,(1996) , 10.3233/FI-1996-263401
Philippa Gardner, Closed action calculi Theoretical Computer Science. ,vol. 228, pp. 77- 103 ,(1999) , 10.1016/S0304-3975(98)00355-7
Robin Milner, Flowgraphs and Flow Algebras Journal of the ACM. ,vol. 26, pp. 794- 818 ,(1979) , 10.1145/322154.322167
André Joyal, Mogens Nielsen, Glynn Winskel, Bisimulation from Open Maps logic in computer science. ,vol. 127, pp. 164- 185 ,(1996) , 10.1006/INCO.1996.0057
Gérard Berry, Gérard Boudol, The chemical abstract machine Theoretical Computer Science. ,vol. 96, pp. 217- 248 ,(1992) , 10.1016/0304-3975(92)90185-I
Robin Milner, Calculi for interaction Acta Informatica. ,vol. 33, pp. 707- 737 ,(1996) , 10.1007/BF03036472