Name
Abstract | ||
|---|---|---|
We define transactional graph transformation systems (t-gtss), a mild extension of the ordinary framework for the double-pushout approach to graph transformation, which allows to model transactional activities. Generalising the work on zero-safe nets, the new graphical formalism is based on a typing discipline which induces a distinction between stable and unstable items. A transaction is then a suitably defined minimal computation which starts and ends in stable states. After providing the basics of t-gtss, we illustrate the expected results, needed to bring the theory to full maturity, and some possible future developments. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.entcs.2008.04.028 | Electr. Notes Theor. Comput. Sci. |
Keywords | Field | DocType |
transactional activity,transactions,double-pushout approach,full maturity,transactions.,graph transformations,zero-safe nets,mild extension,expected result,graph rewriting,new graphical formalism,minimal computation,transactional graph transformation system,graph transformation,stable state | Discrete mathematics,Graph property,Computer science,Directed graph,Theoretical computer science,Null graph,Graph rewriting,Lattice graph,Voltage graph,Moral graph,Graph (abstract data type) | Journal |
Volume | ISSN | Citations |
211, | Electronic Notes in Theoretical Computer Science | 4 |
PageRank | References | Authors |
0.45 | 8 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| P. Baldan | 1 | 51 | 4.13 |
| Andrea Corradini | 2 | 56 | 4.62 |
| F. L. Dotti | 3 | 4 | 0.79 |
| L. Foss | 4 | 4 | 0.45 |
| Fabio Gadducci | 5 | 87 | 7.95 |
| L. Ribeiro | 6 | 4 | 0.45 |