Shallow Linear Action Graphs and their Embeddings

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. Received October 2000 / Accepted in revised form April 2001