Petri Nets, Event Structures and Domains. - Mogens Nielsen; Gordon D. Plotkin; Glynn Winskel (Semantics of Concurrent Computation, 1979)

An Exercise in Processes with Infinite Pasts. - Glynn Winskel (Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets, 1981)

Petri Nets, Event Structures and Domains, Part I. - Mogens Nielsen; Gordon D. Plotkin; Glynn Winskel (Theor. Comput. Sci., 1981)

Event Structure Semantics for CCS and Related Languages. - Glynn Winskel (ICALP, 1982)

A Note on Powerdomains and Modalitiy. - Glynn Winskel (FCT, 1983)

Synchronisation Trees. - Glynn Winskel (ICALP, 1983)

On the Composition and Decomposition of Assertions. - Glynn Winskel (Seminar on Concurrency, 1984)

Categories of Models for Concurrency. - Glynn Winskel (Seminar on Concurrency, 1984)

Using Information Systems to Solve Recursive Domain Equations Effectively. - Glynn Winskel; Kim Guldstrand Larsen (Semantics of Data Types, 1984)

A New Definition of Morphism on Petri Nets. - Glynn Winskel (STACS, 1984)

Synchronization Trees. - Glynn Winskel (Theor. Comput. Sci., 1984)

Petri nets, morphisms and compositionality. - Glynn Winskel (Applications and Theory in Petri Nets, 1985)

Category Theory and Models for Parallel Computation. - Glynn Winskel (CTCS, 1985)

A Complete System for SCCS with Modal Assertions. - Glynn Winskel (FSTTCS, 1985)

On Powerdomains and Modality. - Glynn Winskel (Theor. Comput. Sci., 1985)

Event Structures. - Glynn Winskel (Advances in Petri Nets, 1986)

Relating Two Models of Hardware. - Glynn Winskel (Category Theory and Computer Science, 1987)

DI-Domains as a Model of Polymorphism. - Thierry Coquand; Carl A. Gunter; Glynn Winskel (MFPS, 1987)

Petri Nets, Algebras, Morphisms, and Compositionality - Glynn Winskel (Inf. Comput., 1987)

A Category of Labelled Petri Nets and Compositional Proof System (Extended Abstract) - Glynn Winskel (LICS, 1988)

An introduction to event structures. - Glynn Winskel (REX Workshop, 1988)

Domain Theoretic Models of Polymorphism - Thierry Coquand; Carl A. Gunter; Glynn Winskel (Inf. Comput., 1989)

Petri Nets as Models of Linear Logic. - Uffe Engberg; Glynn Winskel (CAAP, 1990)

On the Compositional Checking of Validity (Extended Abstract). - Glynn Winskel (CONCUR, 1990)

A Compositional Proof System on a Category of Labelled Transition Systems - Glynn Winskel (Inf. Comput., 1990)

Compositional Checking of Satisfaction. - Henrik Reif Andersen; Glynn Winskel (CAV, 1991)

Petri Nets and Transition Systems (Abstract for an invited talk). - Glynn Winskel (FSTTCS, 1991)

A Note on Model Checking the Modal nu-Calculus. - Glynn Winskel (Theor. Comput. Sci., 1991)

Using Information Systems to Solve Recursive Domain Equations - Kim Guldstrand Larsen; Glynn Winskel (Inf. Comput., 1991)

Compositional Checking of Satsfaction. - Henrik Reif Andersen; Glynn Winskel (Formal Methods Syst. Des., 1992)

The formal semantics of programming languages - an introduction. - Glynn Winskel (MIT Press, 1993)

A Classification of Models for Concurrency. - Vladimiro Sassone; Mogens Nielsen; Glynn Winskel (CONCUR, 1993)

Bisimulation and open maps - André Joyal; Mogens Nielsen; Glynn Winskel (LICS, 1993)

Deterministic Behavioural Models for Concurrency. - Vladimiro Sassone; Mogens Nielsen; Glynn Winskel (MFCS, 1993)

Linear Logic on Petri Nets. - Uffe Engberg; Glynn Winskel (REX School/Symposium, 1993)

Relationships Between Models of Concurrency. - Mogens Nielsen; Vladimiro Sassone; Glynn Winskel (REX School/Symposium, 1993)

Bistructures, Bidomains and Linear Logic. - Gordon D. Plotkin; Glynn Winskel (ICALP, 1994)

A Compositional Proof System for the Modal mu-Calculus - Henrik Reif Andersen; Colin Stirling; Glynn Winskel (LICS, 1994)

Stable Bistructure Models of PCF. - Glynn Winskel (MFCS, 1994)

Trace Structures and other Models for Concurrency. - Mogens Nielsen; Glynn Winskel (The Book of Traces, 1995)

CCS with Priority Choice - Juanito Camilleri; Glynn Winskel (Inf. Comput., 1995)

A Presheaf Semantics of Value-Passing Processes. - Glynn Winskel (CONCUR, 1996)

Presheaf Models for Concurrency. - Gian Luca Cattani; Glynn Winskel (CSL, 1996)

Presheaves as transition systems. - Glynn Winskel; Mogens Nielsen (Partial Order Methods in Verification, 1996)

Bisimulation from Open Maps. - André Joyal; Mogens Nielsen; Glynn Winskel (Inf. Comput., 1996)

Petri Nets and Bisimulation. - Mogens Nielsen; Glynn Winskel (Theor. Comput. Sci., 1996)

Models for Concurrency: Towards a Classification. - Vladimiro Sassone; Mogens Nielsen; Glynn Winskel (Theor. Comput. Sci., 1996)

Presheaf Models for the pi-Calculus. - Gian Luca Cattani; Ian Stark; Glynn Winskel (Category Theory and Computer Science, 1997)

Completeness Results for Linear Logic on Petri Nets. - Uffe Engberg; Glynn Winskel (Ann. Pure Appl. Log., 1997)

An Operational Understanding of Bisimulation from Open Maps. - Glynn Winskel (HOOTS, 1997)

A Linear Metalanguage for Concurrency. - Glynn Winskel (AMAST, 1998)

A Categorical Axiomatics for Bisimulation. - Gian Luca Cattani; John Power; Glynn Winskel (CONCUR, 1998)

A Theory of Recursive Domains with Applications to Concurrency. - Gian Luca Cattani; Marcelo P. Fiore; Glynn Winskel (LICS, 1998)

Event Structures as Presheaves -Two Representation Theorems. - Glynn Winskel (CONCUR, 1999)

Weak Bisimulation and Open Maps. - Marcelo P. Fiore; Gian Luca Cattani; Glynn Winskel (LICS, 1999)

Bistructures, bidomains, and linear logic. - Pierre-Louis Curien; Gordon D. Plotkin; Glynn Winskel (Proof, Language, and Interaction, 2000)

Preface. - Carsten Butz; Ulrich Kohlenbach; Søren Riis; Glynn Winskel (Ann. Pure Appl. Log., 2000)

Events in security protocols. - Federico Crazzolara; Glynn Winskel (CCS, 2001)

Petri nets in cryptographic protocols. - Federico Crazzolara; Glynn Winskel (IPDPS, 2001)

A Higher-Order Calculus for Categories. - Mario Cáccamo; Glynn Winskel (TPHOLs, 2001)

HOPLA-A Higher-Order Process Language. - Mikkel Nygaard; Glynn Winskel (CONCUR, 2002)

Calculus for categories. - Glynn Winskel (FICS, 2002)

Composing Strand Spaces. - Federico Crazzolara; Glynn Winskel (FSTTCS, 2002)

Linearity in Process Languages. - Mikkel Nygaard; Glynn Winskel (LICS, 2002)

Guest Editorial. - Glynn Winskel (Inf. Comput., 2002)

Full Abstraction for HOPLA. - Mikkel Nygaard; Glynn Winskel (CONCUR, 2003)

Presheaf models for CCS-like languages. - Gian Luca Cattani; Glynn Winskel (Theor. Comput. Sci., 2003)

New-HOPLA: A Higher-order Process Language with Name Generation. - Glynn Winskel; Francesco Zappa Nardelli (IFIP TCS, 2004)

Limit Preservation from Naturality. - Mario Cáccamo; Glynn Winskel (CTCS, 2004)

Petri Nets With Persistence. - Federico Crazzolara; Glynn Winskel (WISP@ICATPN, 2004)

A relational model of non-deterministic dataflow. - Thomas T. Hildebrandt; Prakash Panangaden; Glynn Winskel (Math. Struct. Comput. Sci., 2004)

Domain theory for concurrency. - Mikkel Nygaard; Glynn Winskel (Theor. Comput. Sci., 2004)

Relations in Concurrency. - Glynn Winskel (LICS, 2005)

Name Generation and Linearity. - Glynn Winskel (LICS, 2005)

Profunctors, open maps and bisimulation. - Gian Luca Cattani; Glynn Winskel (Math. Struct. Comput. Sci., 2005)

Event Structure Spans for Nondeterministic Dataflow. - Lucy Saunders-Evans; Glynn Winskel (EXPRESS, 2006)

Distributing probability over non-determinism. - Daniele Varacca; Glynn Winskel (Math. Struct. Comput. Sci., 2006)

Probabilistic event structures and domains. - Daniele Varacca; Hagen Völzer; Glynn Winskel (Theor. Comput. Sci., 2006)

Symmetry and Concurrency. - Glynn Winskel (CALCO, 2007)

Preface. - Luca Cardelli; Marcelo P. Fiore; Glynn Winskel (Computation, Meaning, and Logic, 2007)

Event Structures with Symmetry. - Glynn Winskel (Computation, Meaning, and Logic, 2007)

Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra. - Gérard Boudol; Ilaria Castellani; Matthew Hennessy; Mogens Nielsen; Glynn Winskel (Concurrency, Graphs and Models, 2008)

The unfolding of general Petri nets. - Jonathan Hayman; Glynn Winskel (FSTTCS, 2008)

Independence and Concurrent Separation Logic. - Jonathan Hayman; Glynn Winskel (Log. Methods Comput. Sci., 2008)

Nominal Domain Theory for Concurrency. - David Turner; Glynn Winskel (CSL, 2009)

Prime algebraicity. - Glynn Winskel (Theor. Comput. Sci., 2009)

On the Expressivity of Symmetry in Event Structures. - Sam Staton; Glynn Winskel (LICS, 2010)

Concurrent Strategies. - Silvain Rideau; Glynn Winskel (LICS, 2011)

Events, Causality and Symmetry. - Glynn Winskel (Comput. J., 2011)

Containment in Rule-Based Models. - Christopher D. Thompson-Walsh; Jonathan Hayman; Glynn Winskel (SASB, 2011)

Winning, Losing and Drawing in Concurrent Games with Perfect or Imperfect Information. - Glynn Winskel (Logic and Program Semantics, 2012)

Bicategories of Concurrent Games - (Invited Paper). - Glynn Winskel (FoSSaCS, 2012)

Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models. - Vincent Danos; Jérôme Feret; Walter Fontana; Russell Harmer; Jonathan Hayman; Jean Krivine; Christopher D. Thompson-Walsh; Glynn Winskel (FSTTCS, 2012)

The Winning Ways of Concurrent Games. - Pierre Clairambault; Julian Gutierrez 001; Glynn Winskel (LICS, 2012)

Deterministic concurrent strategies. - Glynn Winskel (Formal Aspects Comput., 2012)

Imperfect Information in Logic and Concurrent Games. - Pierre Clairambault; Julian Gutierrez 001; Glynn Winskel (Computation, Logic, Games, and Quantum Foundations, 2013)

Borel Determinacy of Concurrent Games. - Julian Gutierrez 001; Glynn Winskel (CONCUR, 2013)

Strategies as Profunctors. - Glynn Winskel (FoSSaCS, 2013)

On Concurrent Games with Payoff. - Pierre Clairambault; Glynn Winskel (MFPS, 2013)

Distributed Probabilistic and Quantum Strategies. - Glynn Winskel (MFPS, 2013)

Constraining rule-based dynamics with types. - Vincent Danos; Russell Harmer; Glynn Winskel (Math. Struct. Comput. Sci., 2013)

Probabilistic and Quantum Event Structures. - Glynn Winskel (Horizons of the Mind, 2014)

Symmetry in concurrent games. - Simon Castellan; Pierre Clairambault; Glynn Winskel (CSL-LICS, 2014)

Concurrent Hyland-Ong games. - Simon Castellan; Pierre Clairambault; Glynn Winskel (CoRR, 2014)

Strategies as Concurrent Processes. - Simon Castellan; Jonathan Hayman; Marc Lasson; Glynn Winskel (MFPS, 2014)

On the determinacy of concurrent games on event structures with infinite winning sets. - Julian Gutierrez 001; Glynn Winskel (J. Comput. Syst. Sci., 2014)

On Probabilistic Distributed Strategies. - Glynn Winskel (ICTAC, 2015)

The Parallel Intensionally Fully Abstract Games Model of PCF. - Simon Castellan; Pierre Clairambault; Glynn Winskel (LICS, 2015)

Concurrent Games. - Simon Castellan; Pierre Clairambault; Silvain Rideau; Glynn Winskel (CoRR, 2016)

Distributed Games and Strategies. - Glynn Winskel (CoRR, 2016)

Strategies with Parallel Causes. - Marc de Visme; Glynn Winskel (CSL, 2017)

Distributed Strategies Made Easy. - Simon Castellan; Pierre Clairambault; Glynn Winskel (MFCS, 2017)

Observably Deterministic Concurrent Strategies and Intensional Full Abstraction for Parallel-or. - Simon Castellan; Pierre Clairambault; Glynn Winskel (FSCD, 2017)

Games and Strategies as Event Structures. - Simon Castellan; Pierre Clairambault; Silvain Rideau; Glynn Winskel (Log. Methods Comput. Sci., 2017)

The True Concurrency of Herbrand's Theorem. - Aurore Alcolei; Pierre Clairambault; Martin Hyland; Glynn Winskel (CSL, 2018)

Non-angelic Concurrent Game Semantics. - Simon Castellan; Pierre Clairambault; Jonathan Hayman; Glynn Winskel (FoSSaCS, 2018)

The concurrent game semantics of Probabilistic PCF. - Simon Castellan; Pierre Clairambault; Hugo Paquet; Glynn Winskel (LICS, 2018)

Continuous Probability Distributions in Concurrent Games. - Hugo Paquet; Glynn Winskel (MFPS, 2018)

Causal Unfoldings. - Marc de Visme; Glynn Winskel (CALCO, 2019)

Concurrent Quantum Strategies. - Pierre Clairambault; Marc de Visme; Glynn Winskel (RC, 2019)

Thin Games with Symmetry and Concurrent Hyland-Ong Games. - Simon Castellan; Pierre Clairambault; Glynn Winskel (Log. Methods Comput. Sci., 2019)

Game semantics for quantum programming. - Pierre Clairambault; Marc de Visme; Glynn Winskel (Proc. ACM Program. Lang., 2019)

The Mays and Musts of Concurrent Strategies. - Simon Castellan; Pierre Clairambault; Glynn Winskel (CoRR, 2021)

Making Concurrency Functional. - Glynn Winskel (LICS, 2023)

Causal Unfoldings and Disjunctive Causes. - Marc de Visme; Glynn Winskel (Log. Methods Comput. Sci., 2023)

Concurrent Games over Relational Structures: The Origin of Game Comonads. - Yoàv Montacute; Glynn Winskel (LICS, 2024)

Concurrent Strategies on Games with Algebras. - Sacha Huriot-Tattegrain; Glynn Winskel (CoRR, 2024)

Distributed Strategies - Past and Future. - Glynn Winskel (ACM SIGLOG News, 2025)