Towards a Notion of Transaction in Graph Rewriting

  • Authors:
  • P. Baldan;A. Corradini;F. L. Dotti;L. Foss;F. Gadducci;L. Ribeiro

  • Affiliations:
  • Dipartimento di Informatica, Università Ca' Foscari di Venezia, Venice, Italy;Dipartimento di Informatica, Università di Pisa, Pisa, Italy;Faculdade de Informática, Pontifícia Universidade Católica do Rio Grande do Sul, Porto Alegre, Brazil;Dipartimento di Informatica, Università di Pisa, Pisa, Italy and Instituto de Informática, Universidade Federal do Rio Grande do Sul, Porto Alegre, Brazil;Dipartimento di Informatica, Università di Pisa, Pisa, Italy;Instituto de Informática, Universidade Federal do Rio Grande do Sul, Porto Alegre, Brazil

  • Venue:
  • Electronic Notes in Theoretical Computer Science (ENTCS)
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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.