A Graph Abstract Machine Describing Event Structure Composition

DOI10.1016/j.entcs.2007.04.014zbMath1278.68092OpenAlexW2035512820MaRDI QIDQ2867884

Claudia Faggian, Mauro Piccolo

Publication date: 20 December 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2007.04.014

zbMATH Keywords

directed acyclic graphlinear logicproof netsgame semanticsevent structures

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Directed graphs (digraphs), tournaments (05C20) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (3)

Typed event structures and the linear \(\pi \)-calculus ⋮ Partial Orders, Event Structures and Linear Strategies ⋮ Probabilistic π-Calculus and Event Structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• Petri nets, event structures and domains. I
• Locus Solum: From the rules of logic to the logic of rules
• Partial Orders, Event Structures and Linear Strategies
• Foundations of Software Science and Computation Structures
• CONCUR 2004 - Concurrency Theory
• Computer Science Logic
• CONCUR 2005 – Concurrency Theory

This page was built for publication: A Graph Abstract Machine Describing Event Structure Composition