Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Handbook of logic in computer science (vol. 4)
On full abstraction for PCF: I, II, and III
Information and Computation
Information and Computation
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Games on Graphs and Sequentially Realizable Functionals
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
An introduction to event structures
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Concurrent Games and Full Completeness
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
Strong normalisation in the π-calculus
Information and Computation
Ludics Nets, a game Model of Concurrent Interaction
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
A game semantics of the asynchronous π-calculus
CONCUR 2005 - Concurrency Theory
Asynchronous games 2: the true concurrency of innocence
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
A Graph Abstract Machine Describing Event Structure Composition
Electronic Notes in Theoretical Computer Science (ENTCS)
Concrete Data Structures as Games
Electronic Notes in Theoretical Computer Science (ENTCS)
Typed Event Structures and the π-Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Ludics is a model for the finitary linear pi-calculus
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
L-Nets, strategies and proof-nets
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Asynchronous games: innocence without alternation
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
An approach to innocent strategies as graphs
Information and Computation
| Hi-index | 0.00 |
We introduce a Game Semantics where strategies are partial orders, and composition is a generalization of the merging of orders. Building on this, to bridge between Game Semantics and Concurrency, we explore the relation between Event Structures and Linear Strategies. The former are a true concurrency model introduced by Nielsen, Plotkin, Winskel, the latter a family of linear innocent strategies developed starting from Girard's work in the setting of Ludics. We extend our construction on partial orders to classes of event structures, showing how to reduce composition of event structures to the simple definition of merging of orders. Finally, we introduce a compact closed category of event structures which embeds Linear Strategies.