Partial Orders, Event Structures and Linear Strategies

DOI10.1007/978-3-642-02273-9_9zbMath1246.03078OpenAlexW1557509894MaRDI QIDQ3637188

Mauro Piccolo, Claudia Faggian

Publication date: 7 July 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-02273-9_9

Mathematics Subject Classification ID

Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (7)

Strategies as concurrent processes ⋮ Order algebras: a quantitative model of interaction ⋮ An approach to innocent strategies as graphs ⋮ Bayesian strategies: probabilistic programs as generalised graphical models ⋮ Distributed Strategies Made Easy ⋮ An interpretation of CCS into ludics ⋮ A Graph Abstract Machine Describing Event Structure Composition

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong normalisation in the \(\pi\)-calculus
• Petri nets, event structures and domains. I
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• Asynchronous games. II: The true concurrency of innocence
• Locus Solum: From the rules of logic to the logic of rules
• A Graph Abstract Machine Describing Event Structure Composition
• Asynchronous Games: Innocence Without Alternation
• Ludics is a Model for the Finitary Linear Pi-Calculus
• Foundations of Software Science and Computation Structures
• Computer Science Logic
• CONCUR 2005 – Concurrency Theory

This page was built for publication: Partial Orders, Event Structures and Linear Strategies