Justified sequences in string diagrams: a comparison between two approaches to concurrent game semantics

DOI10.4230/LIPICS.CALCO.2017.10MaRDI QIDQ4580205zbMATH OpenFDO

Authors Clovis Eberhart, Tom Hirschowitz

Publication date 13 August 2018

zbMATH Keywords

concurrencygame semanticssheavespresheaf models

Mathematics Subject Classification ID

Applications of game theory (91A80) Grothendieck topologies and Grothendieck topoi (18F10) Presheaves and sheaves, stacks, descent conditions (category-theoretic aspects) (18F20) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Game Semantics in String Diagrams
• Concurrent structures in game semantics
• A truly concurrent game model of the asynchronous \(\pi\)-calculus
• What's in a game?
• CONCUR 2005 – Concurrency Theory

Cited in

(3)

• Game Semantics in String Diagrams
• Fibred pseudo double categories for game semantics
• A graphical foundation for interleaving in game semantics

This page was built for publication: Justified sequences in string diagrams: a comparison between two approaches to concurrent game semantics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580205)