Fundamenta Informaticae - Special issue on graph transformations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
Handbook of graph grammars and computing by graph transformation: vol. 2: applications, languages, and tools
Application of graph transformation to visual languages
Handbook of graph grammars and computing by graph transformation
Classification and comparison of module concepts for graph transformation systems
Handbook of graph grammars and computing by graph transformation
Zero-safe nets: comparing the collective and individual token approaches
Information and Computation - Special issue on EXPRESS 1997
Refinements of Graph Transformation Systems via Rule Expressions
TAGT'98 Selected papers from the 6th International Workshop on Theory and Application of Graph Transformations
Unfolding of Double-Pushout Graph Grammars is a Coreflection
TAGT'98 Selected papers from the 6th International Workshop on Theory and Application of Graph Transformations
Transactions and Zero-Safe Nets
Unifying Petri Nets, Advances in Petri Nets
Graph transactions as processes
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Hi-index | 0.00 |
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.