A Graph Abstract Machine Describing Event Structure Composition

Abstract Machine Describing Event Structure Composition Claudia Faggian and Mauro Piccolo 1 ,2 ,3 Dipartimento di Matematica Pura e Applicata – PPS Universit´a di Padova – Paris7-CNRS 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 r 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.

• Type: Journal
• Year: 2007
• Where: ENTCS
• Authors: Claudia Faggian, Mauro Piccolo
• Keywords: Abstract Machine, ENTCS 2007, Event Structure Composition, Event Structures