Skip to main content
Research
  1. Queen Mary University of London
  2. Research
  3. Publications

Publications: PROF Glynn Winskel

Back to Search
Winskel G ( 2025 ) . Distributed Strategies—Past and Future . ACM SIGLOG News vol. 12 , ( 2 ) 3 - 33 .
Montacute Y, Winskel G ( 2024 ) . Concurrent Games over Relational Structures: The Origin of Game Comonads . Conference: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science1 - 14 .
Castellan S, Clairambault P, Winskel G ( 2023 ) . The Mays and Musts of Concurrent Strategies . Samson Abramsky on Logic and Structure in Computer Science and Beyond , vol. 25 , Springer Nature
Winskel G ( 2023 ) . Making Concurrency Functional . Conference: 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) vol. 00 , 1 - 14 .
de Visme M, Winskel G ( 2023 ) . Causal Unfoldings and Disjunctive Causes . Logical Methods in Computer Science vol. Volume 19, Issue 2 ,
de Visme M, Winskel G ( 2019 ) . Causal unfoldings . Leibniz International Proceedings in Informatics Lipics . vol. 139 ,
Clairambault P, de Visme M, Winskel G ( 2019 ) . Concurrent Quantum Strategies . Lecture Notes in Computer Science . vol. 11497 , 3 - 19 .
Castellan S, Clairambault P, Winskel G ( 2019 ) . Thin Games with Symmetry and Concurrent Hyland-Ong Games . Logical Methods in Computer Science vol. Volume 15, Issue 1 ,
Clairambault P, De Visme M, Winskel G ( 2019 ) . Game semantics for quantum programming . Proceedings of the ACM on Programming Languages vol. 3 , ( POPL ) 1 - 29 .
Paquet H, Winskel G ( 2018 ) . Continuous Probability Distributions in Concurrent Games . Electronic Notes in Theoretical Computer Science vol. 341 , 321 - 344 .
Alcolei A, Clairambault P, Hyland M, Winskel G ( 2018 ) . The true concurrency of herbrand's theorem . Leibniz International Proceedings in Informatics Lipics . vol. 119 ,
Castellan S, Clairambault P, Paquet H, Winskel G ( 2018 ) . The concurrent game semantics of Probabilistic PCF . Conference: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science215 - 224 .
Castellan S, Clairambault P, Hayman J, Winskel G ( 2018 ) . Non-angelic Concurrent Game Semantics . Lecture Notes in Computer Science . vol. 10803 , 3 - 19 .
Fiore M, Gambino N, Hyland M, Winskel G ( 2017 ) . Relative pseudomonads, Kleisli bicategories, and substitution monoidal structures . Selecta Mathematica vol. 24 , ( 3 ) 2791 - 2830 .
Castellan S, Clairambault P, Winskel G ( 2017 ) . Distributed strategies made easy . Leibniz International Proceedings in Informatics Lipics . vol. 83 ,
Castellan S, Clairambault P, Rideau S, Winskel G ( 2017 ) . Games and Strategies as Event Structures . Logical Methods in Computer Science vol. Volume 13, Issue 3 ,
Castellan S, Clairambault P, Winskel G ( 2017 ) . Observably deterministic concurrent strategies & intensional full abstraction for parallel-or . Leibniz International Proceedings in Informatics Lipics . vol. 84 ,
De Visme M, Winskel G ( 2017 ) . Strategies with parallel causes . Leibniz International Proceedings in Informatics Lipics . vol. 82 ,
Winskel G ( 2015 ) . On Probabilistic Distributed Strategies . Lecture Notes in Computer Science . vol. 9399 , 69 - 88 .
Castellan S, Clairambault P, Winskel G ( 2015 ) . The Parallel Intensionally Fully Abstract Games Model of PCF . Conference: 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science232 - 243 .
Castellan S, Hayman J, Lasson M, Winskel G ( 2014 ) . Strategies as Concurrent Processes . Electronic Notes in Theoretical Computer Science . vol. 308 , 87 - 107 .
Gutierrez J, Winskel G ( 2014 ) . On the determinacy of concurrent games on event structures with infinite winning sets . Journal of Computer and System Sciences vol. 80 , ( 6 ) 1119 - 1137 .
Castellan S, Clairambault P, Winskel G ( 2014 ) . Symmetry in concurrent games . Conference: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)1 - 10 .
Löwe B, Winskel G ( 2014 ) . Preface . Electronic Proceedings in Theoretical Computer Science Eptcs vol. 143 ,
Winskel G ( 2014 ) . Probabilistic and Quantum Event Structures . Lecture Notes in Computer Science . vol. 8464 , 476 - 497 .
Winskel G ( 2013 ) . Distributed Probabilistic and Quantum Strategies . Electronic Notes in Theoretical Computer Science . vol. 298 , 403 - 425 .
Clairambault P, Winskel G ( 2013 ) . On Concurrent Games with Payoff . Electronic Notes in Theoretical Computer Science . vol. 298 , 71 - 92 .
DANOS V, HARMER R, WINSKEL G ( 2013 ) . Constraining rule-based dynamics with types . Mathematical Structures in Computer Science . vol. 23 , 272 - 289 .
Gutierrez J, Winskel G ( 2013 ) . Borel Determinacy of Concurrent Games . Lecture Notes in Computer Science . vol. 8052 , 516 - 530 .
Clairambault P, Gutierrez J, Winskel G ( 2013 ) . Imperfect Information in Logic and Concurrent Games . Lecture Notes in Computer Science vol. 7860 , 7 - 20 .
Winskel G ( 2013 ) . Strategies as Profunctors . Lecture Notes in Computer Science . vol. 7794 , 418 - 433 .
Danos V, Feret J, Fontana W, Harmer R, Hayman J, Krivine J, Thompson-Walsh C, Winskel G ( 2012 ) . Graphs, rewriting and pathway reconstruction for rule-based models . Leibniz International Proceedings in Informatics Lipics . vol. 18 , 276 - 288 .
Winskel G ( 2012 ) . Deterministic concurrent strategies . Formal Aspects of Computing vol. 24 , ( 4-6 ) 647 - 660 .
Thompson-Walsh CD, Hayman J, Winskel G ( 2012 ) . Containment in Rule-Based Models . Electronic Notes in Theoretical Computer Science . vol. 284 , 125 - 137 .
Clairambault P, Gutierrez J, Winskel G ( 2012 ) . The Winning Ways of Concurrent Games . Conference: 2012 27th Annual IEEE Symposium on Logic in Computer Science vol. 1 , 235 - 244 .
Winskel G ( 2012 ) . Bicategories of concurrent games (Invited Paper) . Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics . vol. 7213 LNCS , 26 - 41 .
Winskel G ( 2012 ) . Bicategories of Concurrent Games . Foundations of Software Science and Computational Structures , vol. 7213 , Springer Nature
Winskel G ( 2012 ) . Winning, Losing and Drawing in Concurrent Games with Perfect or Imperfect Information . Lecture Notes in Computer Science vol. 7230 , 298 - 317 .
Rideau S, Winskel G ( 2011 ) . Concurrent Strategies . Conference: 2011 IEEE 26th Annual Symposium on Logic in Computer Science409 - 418 .
Staton S, Winskel G ( 2010 ) . On the expressivity of symmetry in event structures **Dedicated to the memory of Robin Milner . Conference: 2010 25th Annual IEEE Symposium on Logic in Computer Science392 - 401 .
Winskel G ( 2009 ) . Prime algebraicity . Theoretical Computer Science vol. 410 , ( 41 ) 4160 - 4168 .
Winskel G ( 2009 ) . Events, Causality and Symmetry . The Computer Journal vol. 54 , ( 1 ) 42 - 57 .
( 2009 ) . Editors' note: bibliometrics and the curators of orthodoxy . Mathematical Structures in Computer Science vol. 19 , ( 1 ) 1 - 4 .
Turner D, Winskel G ( 2009 ) . Nominal Domain Theory for Concurrency . Lecture Notes in Computer Science . vol. 5771 , 546 - 560 .
Hayman J, Winskel G ( 2008 ) . The unfolding of general Petri nets . Leibniz International Proceedings in Informatics Lipics . vol. 2 , 223 - 234 .
Hayman J, Winskel G ( 2008 ) . Independence and concurrent separation logic . Logical Methods in Computer Science vol. Volume 4, Issue 1 ,
Boudol G, Castellani I, Hennessy M, Nielsen M, Winskel G ( 2008 ) . Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra . Lecture Notes in Computer Science . vol. 5065 , 757 - 777 .
Fiore M, Gambino N, Hyland M, Winskel G ( 2007 ) . The cartesian closed bicategory of generalised species of structures . Journal of the London Mathematical Society vol. 77 , ( 1 ) 203 - 220 .
Saunders-Evans L, Winskel G ( 2007 ) . Event Structure Spans for Nondeterministic Dataflow . Electronic Notes in Theoretical Computer Science vol. 175 , ( 3 ) 109 - 129 .
Winskel G ( 2007 ) . Event Structures with Symmetry . Electronic Notes in Theoretical Computer Science vol. 172 , 611 - 652 .
Cardelli L, Fiore M, Winskel G ( 2007 ) . Preface . Electronic Notes in Theoretical Computer Science vol. 172 , 1 - 4 .
Winskel G ( 2007 ) . Symmetry and Concurrency . Lecture Notes in Computer Science . vol. 4624 , 40 - 64 .
Varacca D, Völzer H, Winskel G ( 2006 ) . Probabilistic event structures and domains . Theoretical Computer Science vol. 358 , ( 2-3 ) 173 - 199 .
Cattani GL, Power J, Winskel G ( 1998 ) . A categorical axiomatics for bisimulation . Lecture Notes in Computer Science . vol. 1466 , 581 - 596 .
Hildebrandt T, Panangaden P, Winskel G ( 1998 ) . A relational model of non-deterministic dataflow . Lecture Notes in Computer Science . vol. 1466 , 613 - 628 .
VARACCA D, WINSKEL G ( 2006 ) . Distributing probability over non-determinism . Mathematical Structures in Computer Science vol. 16 , ( 1 ) 87 - 113 .
Hayman J, Winskel G ( 2006 ) . Independence and Concurrent Separation Logic . Conference: 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)147 - 156 .
Winskel G ( 1983 ) . Synchronisation trees . Lecture Notes in Computer Science . vol. 154 , 695 - 711 .
Winskel G ( 1989 ) . A note on model checking the modal v-calculus . Lecture Notes in Computer Science . vol. 372 , 761 - 772 .
Winskel G ( 2005 ) . Name generation and linearity . Proceedings Symposium on Logic in Computer Science . 301 - 310 .
Winskel G ( 2005 ) . Relations in concurrency . Proceedings Symposium on Logic in Computer Science . 2 - 11 .
Winskel G ( 1982 ) . Event structure semantics for CCS and related languages . Lecture Notes in Computer Science . vol. 140 , 561 - 576 .
Cattani GL, Stark I, Winskel G ( 1997 ) . Presheaf models for the π-calculus . Lecture Notes in Computer Science . vol. 1290 , 106 - 126 .
Winskel G ( 2005 ) . On the compositional checking of validity . CONCUR '90 Theories of Concurrency: Unification and Extension , vol. 458 , Springer Nature
Winskel G ( 2005 ) . An introduction to event structures . Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency , vol. 354 , Springer Nature
Nielsen M, Plotkin G, Winskel G ( 1979 ) . Petri nets, event structures and domains . Lecture Notes in Computer Science . vol. 70 , 266 - 284 .
Cattani GL, Winskel G ( 2005 ) . Presheaf models for concurrency . Computer Science Logic , vol. 1258 , Springer Nature
Engberg U, Winskel G ( 1994 ) . Linear logic on Petri nets . Lecture Notes in Computer Science . vol. 803 , 176 - 229 .
Nielsen M, Sassone V, Winskel G ( 1994 ) . Relationships between models of concurrency . Lecture Notes in Computer Science . vol. 803 , 425 - 476 .
Winskel G ( 1994 ) . Stable bistructure models of PCF . Lecture Notes in Computer Science . vol. 841 , 177 - 197 .
Winskel G ( 2005 ) . A presheaf semantics of value-passing processes . CONCUR '96: Concurrency Theory , vol. 1119 , Springer Nature
Engberg U, Winskel G ( 1990 ) . Petri nets as models of linear logic . Lecture Notes in Computer Science . vol. 431 , 147 - 161 .
Winskel G ( 1983 ) . A note on powerdomains and modality . Lecture Notes in Computer Science . vol. 158 , 505 - 514 .
Winskel G ( 1986 ) . Category theory and models for parallel computation . Lecture Notes in Computer Science . vol. 240 , 266 - 281 .
Winskel G ( 1987 ) . Relating two models of hardware . Lecture Notes in Computer Science . vol. 283 , 98 - 113 .
Larsen KG, Winskel G ( 1984 ) . Using information systems to solve reoursive domain equations effectively . Lecture Notes in Computer Science . vol. 173 , 109 - 129 .
Engberg U, Winskel G ( 1993 ) . Completeness results for linear logic on Petri nets . Lecture Notes in Computer Science . vol. 711 , 442 - 452 .
Sassone V, Nielsen M, Winskel G ( 1993 ) . Deterministic behavioural models for concurrency . Lecture Notes in Computer Science . vol. 711 , 682 - 692 .
Winskel G ( 2005 ) . A complete proof system for SCCS with modal assertions . Foundations of Software Technology and Theoretical Computer Science , vol. 206 , Springer Nature
Winskel G ( 1984 ) . A new definition of morphism on Petri nets . Lecture Notes in Computer Science . vol. 166 , 140 - 150 .
Plotkin G, Winskel G ( 1994 ) . Bistructures, bidomains and linear logic . Lecture Notes in Computer Science . vol. 820 , 352 - 363 .
Winskel G ( 1985 ) . Categories of models for concurrency . Lecture Notes in Computer Science . vol. 197 , 246 - 267 .
Andersen HR, Winskel G ( 2005 ) . Compositional checking of satisfaction . Computer Aided Verification , vol. 575 , Springer Nature
Winskel G ( 1987 ) . Event structures . Lecture Notes in Computer Science . vol. 255 , 325 - 392 .
Winskel G ( 1985 ) . On the composition and decomposition of assertions . Lecture Notes in Computer Science . vol. 197 , 62 - 75 .
Sassone V, Nielsen M, Winskel G ( 1993 ) . A classification of models for concurrency . Lecture Notes in Computer Science . vol. 715 , 82 - 96 .
CATTANI GL, WINSKEL G ( 2005 ) . Profunctors, open maps and bisimulation . Mathematical Structures in Computer Science . vol. 15 , 553 - 614 .
Coquand T, Gunter C, Winskel G ( 1988 ) . dI-domains as a model of polymorphism . Lecture Notes in Computer Science . vol. 298 , 344 - 363 .
Caccamo M, Winskel G ( 2005 ) . Limit Preservation from Naturality . Electronic Notes in Theoretical Computer Science . vol. 122 , 3 - 22 .
Crazzolara F, Winskel G ( 2005 ) . Petri Nets With Persistence . Electronic Notes in Theoretical Computer Science . vol. 121 , 143 - 155 .
HILDEBRANDT TT, PANANGADEN P, WINSKEL G ( 2004 ) . A relational model of non-deterministic dataflow . Mathematical Structures in Computer Science vol. 14 , ( 5 ) 613 - 649 .
Nygaard M, Winskel G ( 2004 ) . Domain theory for concurrency . Theoretical Computer Science . vol. 316 , 153 - 190 .
Winskel G, Nardelli FZ ( 2004 ) . New-HOPLA a higher-order process language with name generation . IFIP Advances in Information and Communication Technology . vol. 155 , 521 - 534 .
Varacca D, Völzer H, Winskel G ( 2004 ) . Probabilistic Event Structures and Domains . Lecture Notes in Computer Science vol. 3170 , 481 - 496 .
Cattani GL, Winskel G ( 2003 ) . Presheaf models for CCS-like languages . Theoretical Computer Science vol. 300 , ( 1-3 ) 47 - 89 .
Nygaard M, Winskel G ( 2003 ) . Full Abstraction for HOPLA . Lecture Notes in Computer Science vol. 2761 , 383 - 398 .
Crazzolara F, Winskel G ( 2002 ) . Composing Strand Spaces . Lecture Notes in Computer Science . vol. 2556 , 97 - 108 .
Winskel G ( 2002 ) . GUEST EDITORIAL . Information and Computation . vol. 179 ,
Nygaard M, Winskel G ( 2002 ) . HOPLA—A Higher-Order Process Language . Lecture Notes in Computer Science . vol. 2421 , 434 - 448 .
Winskel G ( 1999 ) . Event Structures as Presheaves—Two Representation Theorems . Lecture Notes in Computer Science . vol. 1664 , 541 - 556 .
Nygaard M, Winskel G ( 2002 ) . Linearity in process languages . 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science . Conference: Proceedings 17th Annual IEEE Symposium on Logic in Computer Science433 - 444 .
Crazzolara F, Winskel G ( 2001 ) . Events in security protocols . Conference: Proceedings of the 8th ACM conference on Computer and Communications Security96 - 105 .
Cáccamo M, Winskel G ( 2001 ) . A Higher-Order Calculus for Categories . Lecture Notes in Computer Science . vol. 2152 , 136 - 153 .
Crazzolara F, Winskel G ( 2001 ) . Petri nets in cryptographic protocols . 2008 IEEE International Symposium on Parallel and Distributed Processing . Conference: Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 20011507 - 1515 .
Power AJ, Cattani GL, Winskel G ( 2000 ) . A representation result for free cocompletions . Journal of Pure and Applied Algebra vol. 151 , ( 3 ) 273 - 286 .
Winskel G ( 1998 ) . A Linear Metalanguage for Concurrency . Lecture Notes in Computer Science . vol. 1548 , 42 - 58 .
Fiore M, Cattani GL, Winskel G ( 1999 ) . Weak bisimulation and open maps . Proceedings Symposium on Logic in Computer Science67 - 76 .
Larsen KG, Skyum S, Winskel G ( 1998 ) . Foreword . Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics vol. 1443 LNCS ,
Cattani GL, Fiore M, Winskel G ( 1998 ) . A theory of recursive domains with applications to concurrency . 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science . Conference: Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226)214 - 225 .
Winskel G ( 1998 ) . An Operational Understanding of Bisimulation from Open Maps . Electronic Notes in Theoretical Computer Science . vol. 10 ,
Engberg U, Winskel G ( 1997 ) . Completeness results for linear logic on Petri nets . Annals of Pure and Applied Logic vol. 86 , ( 2 ) 101 - 135 .
Cattani GL, Winskel G ( 1997 ) . Presheaf models for concurrency . Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics . vol. 1258 , 59 - 75 .
Sassone V, Nielsen M, Winskel G ( 1996 ) . Models for concurrency: Towards a classification . Theoretical Computer Science vol. 170 , ( 1-2 ) 297 - 348 .
Sassone V, Nielsen M, Winskel G ( 1996 ) . Models for concurrency: towards a classification . Theoretical Computer Science vol. 170 , ( 1-2 ) 297 - 348 .
Joyal A, Nielsen M, Winskel G ( 1996 ) . Bisimulation from Open Maps . Information and Computation vol. 127 , ( 2 ) 164 - 185 .
Winskel G ( 1996 ) . A presheaf semantics of value-passing processes (Extended abstract) . Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics . vol. 1119 , 98 - 114 .
Nielsen M, Winskel G ( 1996 ) . Petri nets and bisimulation . Theoretical Computer Science vol. 153 , ( 1-2 ) 211 - 244 .
Camilleri J, Winskel G ( 1995 ) . CCS with Priority Choice . Information and Computation vol. 116 , ( 1 ) 26 - 37 .
Andersen HR, Stirling C, Winskel G ( 1994 ) . Compositional proof system for the modal μ-calculus . Proceedings Symposium on Logic in Computer Science . 144 - 153 .
Joyal A, Nielsen M, Winskel G ( 1993 ) . Bisimulation and open maps . Proceedings Symposium on Logic in Computer Science . 418 - 427 .
Andersen HR, Winskel G ( 1992 ) . Compositional checking of satisfaction . Formal Methods in System Design vol. 1 , ( 4 ) 323 - 354 .
Andersen HR, Winskel G ( 1992 ) . Compositional checking of satisfaction . Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics . vol. 575 LNCS , 25 - 36 .
Camilleri J, Winskel G ( 1991 ) . CCS with priority choice . Proceedings Symposium on Logic in Computer Science . 246 - 255 .
Winskel G ( 1991 ) . A note on model checking the modal ν-calculus . Theoretical Computer Science vol. 83 , ( 1 ) 157 - 167 .
Larsen KG, Winskel G ( 1991 ) . Using information systems to solve recursive domain equations . Information and Computation vol. 91 , ( 2 ) 232 - 258 .
Winskel G ( 1991 ) . Petri nets and transition systems . Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics . vol. 560 LNCS ,
Winskel G ( 1990 ) . A compositional proof system on a category of labelled transition systems . Information and Computation vol. 87 , ( 1-2 ) 2 - 57 .
Winskel G ( 1990 ) . On the compositional checking of validity: (extended abstract) . Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics . vol. 458 LNCS , 481 - 501 .
Coquand T, Gunter C, Winskel G ( 1989 ) . Domain theoretic models of polymorphism . Information and Computation vol. 81 , ( 2 ) 123 - 167 .
Winskel G ( 1989 ) . An introduction to event structures . Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics . vol. 354 LNCS , 364 - 397 .
Winskel G ( 1988 ) . Category of labelled petri nets and compositional proof system . undefined . 142 - 154 .
Winskel G ( 1987 ) . Petri nets, algebras, morphisms, and compositionality . Information and Computation vol. 72 , ( 3 ) 197 - 238 .
Winskel G ( 1985 ) . A complete proof system for SCCS with modal assertions: Extended abstract . Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics . vol. 206 LNCS , 392 - 410 .
Winskel G ( 1985 ) . On powerdomains and modality . Theoretical Computer Science vol. 36 , 127 - 137 .
Winskel G ( 1984 ) . Synchronization trees . Theoretical Computer Science vol. 34 , ( 1-2 ) 33 - 82 .
Nielsen M, Plotkin G, Winskel G ( 1981 ) . Petri nets, event structures and domains, part I . Theoretical Computer Science vol. 13 , ( 1 ) 85 - 108 .
Back to Search