@INPROCEEDINGS{BCFG:ICGT2006:GTAP,
  title = {{Graph Transactions as Processes}},
  author = {{Paolo} {Baldan} and {Andrea} {Corradini} and {Luciana} {Foss} and {Fabio} {Gadducci}},
  booktitle = {Proceedings of ICGT 2006, 3rd International Conference on Graph Transformation},
  editor = {Andrea Corradini and  Hartmut Ehrig and  Ugo Montanari and  Leila Ribeiro and  Grzegorz Rozenberg},
  pages = {199-214},
  abstract = {Transactional graph transformation systems (TGTSs) have been recently proposed as a mild extension of the standard DPO approach to graph transformation, equipping it with a suitable notion of atomic execution for computations. A typing mechanism induces a distinction between stable and unstable items, and a transaction is defined as a shift-equivalence class of computations such that the starting and ending states are stable and all the intermediate states are unstable. The paper introduces an equivalent, yet more manageable definition of transaction based on graph processes. This presentation is used to provide a universal characterisation for the class of transactions of a given TGTS. More specifically, we show that the functor mapping a TGTS to a graph transformation system having as productions exactly the transactions of the original TGTS is the right adjoint to an inclusion functor.},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  volume = {4178},
  year = {2006},
  url = {http://rap.dsi.unifi.it/sensoriasite/icgt06Luciana.pdf},
  main = {Y},
  partner = {PISA},
  status = {public},
  task = {T5.2},
}