Recent years have seen a growing interest towards algebraic structures that are able to express formalisms dierent from the standard, tree-like presentation of terms. Many of these approaches reveal a specic interest towards the application to the `distributed and concurrent systems ' eld, but an exhaustive comparison between them is sometimes dicult, because their presentations can be quite dissimilar. This work is a rst step towards a unied view: Focusing on the primitive ingredients of distributed spaces (namely interfaces, links and basic modules), we introduce a general schema for describing a normal form presentation of many algebraic formalisms, and show that those normal forms can be thought of as arrows of suitable
|
532
|
Categories for the Working Mathematician
– Lane
- 1997
|
|
147
|
Elements of interaction
– Milner
- 1993
|
|
117
|
Functional Semantics of Algebraic Theories
– Lawvere
- 1963
|
|
106
|
Membership algebra as a logical framework for equational specification
– Meseguer
- 1998
|
|
96
|
Algebraic Semantics of Imperative Programs
– Goguen, Malcolm
- 1996
|
|
72
|
Interaction categories and the foundations of typed concurrent programming
– Abramsky, Gay, et al.
- 1995
|
|
53
|
Contextual nets
– Montanari, Rossi
- 1995
|
|
53
|
The Tile Model
– Gadducci, Montanari
- 1998
|
|
44
|
Bicategories of processes
– Katis, Sabadini, et al.
- 1997
|
|
44
|
Categories of partial maps
– Robinson, Rosolini
- 1988
|
|
43
|
Recursion from Cyclic Sharing : Traced Monoidal Categories and Models of Cyclic Lambda Calculus, TLCA'97, Springer LNCS 1210
– Hasegawa
- 1997
|
|
38
|
Axiomatizing the algebra of net computations and processes
– Degano, Meseguer, et al.
- 1990
|
|
36
|
Tile Logic for Synchronized Rewriting of Concurrent Systems
– Bruni
- 1999
|
|
36
|
Process and Term Tile Logic
– Bruni, Meseguer, et al.
- 1998
|
|
36
|
Mapping tile logic into rewriting logic
– Meseguer, Montanari
- 1998
|
|
32
|
An algebraic presentation of term graphs, via gs-monoidal categories
– Corradini, Gadducci
- 1999
|
|
30
|
A 2-categorical presentation of term graph rewriting
– Corradini, Gadducci
- 1997
|
|
26
|
Span(Graph): A categorical algebra of transition systems
– Katis, Sabadini, et al.
- 1997
|
|
20
|
An axiomatization of the algebra of Petri net concatenable processes
– Sassone
- 1996
|
|
16
|
The tile model
– Gadducci, Montanari
- 1999
|
|
14
|
A bi-categorical axiomatisation of concurrent graph rewriting
– Gadducci, Heckel, et al.
- 1999
|
|
14
|
Graph rewriting, constraint solving and tiles for coordinating distributed systems, Alg
– Montanari, Rossi
- 1999
|
|
12
|
Representation theorems for Petri nets
– Meseguer, Montanari, et al.
- 1997
|
|
6
|
Equational term graph rewriting. Fundamenta Informaticae
– Ariola, Klop
- 1996
|
|
6
|
On partial algebras
– Hoenke
- 1977
|
|
5
|
Universal algebra in s-monoidal categories
– Pfender
- 1974
|
|
4
|
Towards a new algebraic foundation of owchart scheme theory
– Stefanescu
- 1990
|
|
3
|
Classes of relations as initial abstract data types I. Discrete Mathematics
– Stefanescu
- 1991
|
|
3
|
Natural associativity and commutativity. Rice University Studies
– MacLane
- 1963
|
|
2
|
On the Semantics of Petri Nets: Processes, Unfolding and In Computations
– Sassone
- 1994
|
|
1
|
Maude: Speci and programming in rewriting logic. Available at http://maude.csl.sri.com/manual
– Clavel, Duran, et al.
- 1999
|
|
