(Enter summary)
Abstract: This paper presents the category of embeddings
of shallow linear action graphs (those without nesting), using a novel form of graphical
reasoning which simplifies some otherwise complex manipulations in regular algebra. The
work is done for undirected graphs, and adapted in a few lines to directed graphs.
The graphical reasoning used here will be applied in future work to develop behavioural congruences
for action calculi.
1 Introduction (Update)
Context of citations to this paper: More
...# , a contradiction. This counter example involves neither copying nor discard of arcs, so is applicable to linear action calculi too [LM00b] those in which all source ports bear exactly one arc. Thus we cannot attribute the lack of RPOs to c and #, even though they demand...
Cited by: More
Operational Congruences for Reactive Systems - Leifer (2001)
(Correct)
Active bibliography (related documents): More All
0.6: Contexts and Embeddings for Closed Shallow Action Graphs - Cattani, Leifer, Milner (2000)
(Correct)
0.5: Explicit Fusions - Wischik, Gardner (2000)
(Correct)
0.2: Categorical and Graphical Models of Programming Languages - Part I - Schweimeier (2001)
(Correct)
Similar documents based on text: More All
0.3: A Tool for Implementing Action Graphs - Gardner, Norrish, Serjantov
(Correct)
0.2: Transition systems, link graphs and Petri nets - Leifer, Milner (2004)
(Correct)
0.1: Global Abstraction-Safe Marshalling With Hash Types - Leifer, Peskine, Sewell.. (2003)
(Correct)
Related documents from co-citation: More All
2: Communicating Sequential Processes (context) - Hoare - 1985
BibTeX entry: (Update)
J. J. Leifer and R. Milner. Shallow linear action graphs and their embeddings. Technical Report 508, Computer Laboratory, University of Cambridge, November 2000. {81, 125, 129} http://citeseer.ist.psu.edu/leifer00shallow.html More
@misc{ leifer00shallow,
author = "J. Leifer and R. Milner",
title = "Shallow linear action graphs and their embeddings",
text = "J. J. Leifer and R. Milner. Shallow linear action graphs and their embeddings.
Technical Report 508, Computer Laboratory, University of Cambridge, November
2000. {81, 125, 129}",
year = "2000",
url = "citeseer.ist.psu.edu/leifer00shallow.html" }
Citations (may not include all citations):
410
Mobile ambients
- Cardelli, Gordon - 2000 ACM DBLP
404
A calculus for cryptographic protocols: the spi calculus
- Abadi, Gordon - 1997 DBLP
109
Interaction nets (context) - Lafont - 1990 ACM DBLP
89
Calculi for interaction
- Milner - 1996 DBLP
61
The fusion calculus: expressiveness and symmetry in mobile p..
- Parrow, Victor - 1998 DBLP
50
From rewrite rules to bisimulation congruences
- Sewell - 1998 ACM DBLP
42
Deriving bisimulation congruences for reactive systems
- Leifer, Milner - 2000 ACM DBLP
41
Some techniques for proving correctness of programs which al.. (context) - Burstall - 1972
38
Traced Monoidal Categories (context) - Joyal, Street et al. - 1996
12
Contexts and Embeddings for closed shallow action graphs
- Cattani, Leifer et al. - 2000
12
Control structures
- Mifsud - 1995 ACM DBLP
10
Explicit fusions
- Gardner, Wischik - 2000 ACM DBLP
9
Elementary structures (context) - Honda - 2000
3
Symmetric action calculi
- Gardner, Wischik - 2000
2
Forthcoming PhD Dissertation (context) - Leifer - 2001
1
private communication (context) - Cattani
1
Forthcoming PhD Dissertation (context) - Turnbull
Documents on the same site (http://www.cl.cam.ac.uk/~jjl21/):
Contexts and Embeddings for Closed Shallow Action Graphs - Cattani, Leifer, Milner (2000)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC