CONCUR 2004 - Concurrency Theory

DOI10.1007/B100113zbMATH Open1099.68672OpenAlexW2499482941MaRDI QIDQ5311491FDOQ5311491

Authors: Paul-André Melliès 

Publication date: 23 August 2005

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

Full work available at URL: https://doi.org/10.1007/b100113

Recommendations

• Asynchronous games. II: The true concurrency of innocence
• Asynchronous Games: Innocence Without Alternation
• A truly concurrent game model of the asynchronous \(\pi\)-calculus
• CONCUR 2005 – Concurrency Theory
• Asynchronous games 3 an innocent model of linear logic

zbMATH Keywords

game semantics\(\lambda\)-calculusMazurkiewicz traces

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (14)

• Asynchronous games. II: The true concurrency of innocence
• Resource modalities in tensor logic
• An approach to innocent strategies as graphs
• Angelic semantics of fine-grained concurrency
• Probabilistic \(\pi\)-calculus and event structures
• A truly concurrent game model of the asynchronous \(\pi\)-calculus
• Asynchronous game of life
• A graph abstract machine describing event structure composition
• Game semantics in the nominal model
• Fibred pseudo double categories for game semantics
• Disentangling parallelism and interference in game semantics
• Sequential algorithms and strongly stable functions
• Asynchronous Games: Innocence Without Alternation
• Handshake games

This page was built for publication: CONCUR 2004 - Concurrency Theory

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