by Dorel Lucanu
Depart. of Computer Science, University of Ia��si
http://www.infoiasi.ro/~dlucanu/ijcm95.ps.gz
Add To MetaCart
Abstract:
The paper defines an algebraic tool for manipulating directed acyclic graphs (on short dags). The approach we propose combines two mathematical tools-- category theory and universal algebra-- and it allows an unitary treating of dags transformations. We show that the specification, implementation and programming of concurrent systems can be achieved by using this theory. 1
Citations
|
368
|
Conditional rewriting logic as a unified model of concurrency
– Meseguer
- 1992
|
|
186
|
Graph rewriting: An algebraic and logic approach
– Courcelle
- 1990
|
|
68
|
Graph expressions and graph rewritings
– Bauderon, Courcelle
- 1987
|
|
42
|
A logical theory of concurrent objects
– Meseguer
- 1990
|
|
27
|
Elementary net systems
– Rozenberg, Engelfriet
- 1998
|
|
6
|
Some behavioural aspects of net theory
– Thiagarajan
- 1988
|
|
5
|
eds.): Computing by Graph Transformation
– Ehrig, Korff
- 1994
|
|
5
|
Notes on Algebraic Fundamentals for Theoretical Computer Science
– Thatcher, Wagner, et al.
- 1979
|
|
4
|
Sequential and concurrent behaviour
– Best, Devillers
- 1987
|
|
3
|
Parallel and distributed derivations in the single-pushout approach
– Ehrig, Lowe
- 1993
|
|
2
|
Gh.S¸tefănescu, Classes of finite relations as initial abstract data types
– Căzănescu
- 1991
|
|
1
|
Dauchet: Th'eorie de magmoids (I et
– Arnold, M
- 1978
|
|
1
|
Systems of equations on 2W-algebras
– Lucanu
|
|
1
|
Processes and Traces are Proofs in Petri Net Rewrite Theory, report of
– Lucanu
- 1994
|
|
1
|
Canonical Forms in Dag Algebras report of
– Lucanu
- 1994
|
|
1
|
Rationalit'e et reconnaissabilit'e dans des graphs , Th`ese d'etat
– Warin
- 1986
|
