Download the complete article:

@article{faggian07entcs,
  number = {4},
  volume = {175},
  author = {Claudia Faggian and Mauro Piccolo},
  note = {Appeared in Proceedings of GT-VC, Graph Transformation for
          Verification and Concurrency, Sattelite workshop of CONCUR 2006},
  url = {http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B75H1-4P30GP1-3&_user=525216&_rdoc=1&_fmt=&_orig=search&_sort=d&view=c&_acct=C000026382&_version=1&_urlVersion=0&_userid=525216&md5=3e46264fdb2be71f3d768f931f05a837},
  localfile = {http://www.di.unito.it/~piccolo/pubs/bonn.pdf},
  title = {A Graph Abstract Machine Describing Event Structure Composition},
  abstract = {Event structures, Game Semantics strategies and Linear Logic
              proof-nets arise in different domains (concurrency, semantics,
              proof-theory) but can all be described by means of directed
              acyclic graphs (dag's). They are all equipped with a specific
              notion of composition, interaction or normalization. We report
              on-going work, aiming to investigate the common dynamics which
              seems to underly these different structures. In this paper we
              focus on confusion free event structures on one side, and linear
              strategies [Gir01,FM05] on the other side. We introduce an
              abstract machine which is based on (and generalizes) strategies
              interaction; it processes labelled dag's, and provides a common
              presentation of the composition at work in these different
              settings.},
  journal = {Electronic Notes in Theoretical Computer Science},
  year = {2007},
  pages = {21-36},
}

This document was generated by bib2html 3.3.
(Modified by Luca Paolini, under the GNU General Public License)