Professor Glynn Winskel

Professor
School of Electronic Engineering and Computer Science
Queen Mary University of London
Queen Mary University of London
Publications
Publications of specific relevance to the Centre for Fundamentals of AI and Computational Theory2025
Distributed Strategies—Past and FutureWinskel G
Acm Siglog News, Association For Computing Machinery (Acm) vol. 12 (2), 3-33.
01-04-2025
2024
Concurrent Games over Relational Structures: The Origin of Game ComonadsMontacute Y Winskel G
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science., 1-14.
08-07-2024
2023
Making Concurrency FunctionalWinskel G
2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). vol. 00, 1-14.
29-06-2023
Causal Unfoldings and Disjunctive Causesde Visme M Winskel G
Logical Methods in Computer Science, Centre Pour La Communication Scientifique Directe (Ccsd) vol. Volume 19, Issue 2
20-04-2023
The Mays and Musts of Concurrent StrategiesCastellan S Clairambault P Winskel G
In Samson Abramsky on Logic and Structure in Computer Science and Beyond, Springer Nature 327-361.
01-01-2023
2019
Causal unfoldingsde Visme M Winskel G
Leibniz International Proceedings in Informatics Lipics. vol. 139
01-11-2019
Thin Games with Symmetry and Concurrent Hyland-Ong GamesCastellan S Clairambault P Winskel G
Logical Methods in Computer Science, Centre Pour La Communication Scientifique Directe (Ccsd) vol. Volume 15, Issue 1
04-03-2019
Game semantics for quantum programmingClairambault P De Visme M Winskel G
Proceedings of The Acm on Programming Languages, Association For Computing Machinery (Acm) vol. 3 (POPL), 1-29.
02-01-2019
Concurrent Quantum StrategiesClairambault P de Visme M Winskel G
Lecture Notes in Computer Science. vol. 11497, 3-19.
01-01-2019
2018
Continuous Probability Distributions in Concurrent GamesPaquet H Winskel G
Electronic Notes in Theoretical Computer Science, Elsevier vol. 341, 321-344.
01-12-2018
The true concurrency of herbrand's theoremAlcolei A Clairambault P Hyland M Winskel G
Leibniz International Proceedings in Informatics Lipics. vol. 119
01-08-2018
The concurrent game semantics of Probabilistic PCFCastellan S Clairambault P Paquet H Winskel G
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science., 215-224.
09-07-2018
Non-angelic Concurrent Game SemanticsCastellan S Clairambault P Hayman J Winskel G
Lecture Notes in Computer Science. vol. 10803, 3-19.
01-01-2018
2017
Relative pseudomonads, Kleisli bicategories, and substitution monoidal structuresFiore M Gambino N Hyland M Winskel G
Selecta Mathematica, Springer Nature vol. 24 (3), 2791-2830.
20-11-2017
Distributed strategies made easyCastellan S Clairambault P Winskel G
Leibniz International Proceedings in Informatics Lipics. vol. 83
01-11-2017
Games and Strategies as Event StructuresCastellan S Clairambault P Rideau S Winskel G
Logical Methods in Computer Science, Centre Pour La Communication Scientifique Directe (Ccsd) vol. Volume 13, Issue 3
29-09-2017
Observably deterministic concurrent strategies & intensional full abstraction for parallel-orCastellan S Clairambault P Winskel G
Leibniz International Proceedings in Informatics Lipics. vol. 84
01-09-2017
Strategies with parallel causesDe Visme M Winskel G
Leibniz International Proceedings in Informatics Lipics. vol. 82
01-08-2017
2015
The Parallel Intensionally Fully Abstract Games Model of PCFCastellan S Clairambault P Winskel G
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science., 232-243.
01-07-2015
On Probabilistic Distributed StrategiesWinskel G
Lecture Notes in Computer Science. vol. 9399, 69-88.
01-01-2015
2014
Strategies as Concurrent ProcessesCastellan S Hayman J Lasson M Winskel G
Electronic Notes in Theoretical Computer Science. vol. 308, 87-107.
01-10-2014
On the determinacy of concurrent games on event structures with infinite winning setsGutierrez J Winskel G
Journal of Computer and System Sciences, Elsevier vol. 80 (6), 1119-1137.
01-09-2014
Symmetry in concurrent gamesCastellan S Clairambault P Winskel G
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.
14-07-2014
PrefaceLöwe B Winskel G
Electronic Proceedings in Theoretical Computer Science Eptcs vol. 143
29-03-2014
Probabilistic and Quantum Event StructuresWinskel G
Lecture Notes in Computer Science. vol. 8464, 476-497.
01-01-2014
2013
Distributed Probabilistic and Quantum StrategiesWinskel G
Electronic Notes in Theoretical Computer Science. vol. 298, 403-425.
01-11-2013
On Concurrent Games with PayoffClairambault P Winskel G
Electronic Notes in Theoretical Computer Science. vol. 298, 71-92.
01-11-2013
Constraining rule-based dynamics with typesDANOS V HARMER R WINSKEL G
Mathematical Structures in Computer Science. vol. 23 (2), 272-289.
28-02-2013
Strategies as ProfunctorsWinskel G
Lecture Notes in Computer Science. vol. 7794, 418-433.
01-01-2013
Borel Determinacy of Concurrent GamesGutierrez J Winskel G
Lecture Notes in Computer Science. vol. 8052, 516-530.
01-01-2013
Imperfect Information in Logic and Concurrent GamesClairambault P Gutierrez J Winskel G
Lecture Notes in Computer Science, Springer Nature vol. 7860, 7-20.
01-01-2013
2012
Graphs, rewriting and pathway reconstruction for rule-based modelsDanos V Feret J Fontana W Harmer R Hayman J Krivine J Thompson-Walsh C Winskel G
Leibniz International Proceedings in Informatics Lipics. vol. 18, 276-288.
01-12-2012
Deterministic concurrent strategiesWinskel G
Formal Aspects of Computing, Association For Computing Machinery (Acm) vol. 24 (4-6), 647-660.
29-06-2012
Containment in Rule-Based ModelsThompson-Walsh CD Hayman J Winskel G
Electronic Notes in Theoretical Computer Science. vol. 284, 125-137.
01-06-2012
The Winning Ways of Concurrent GamesClairambault P Gutierrez J Winskel G
2012 27th Annual IEEE Symposium on Logic in Computer Science. vol. 1, 235-244.
01-06-2012
Bicategories of concurrent games (Invited Paper)Winskel G
Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics. vol. 7213 LNCS, 26-41.
03-04-2012
Winning, Losing and Drawing in Concurrent Games with Perfect or Imperfect InformationWinskel G
Lecture Notes in Computer Science, Springer Nature vol. 7230, 298-317.
01-01-2012
Bicategories of Concurrent GamesWinskel G
In Foundations of Software Science and Computational Structures, Springer Nature 26-41.
01-01-2012
2011
Concurrent StrategiesRideau S Winskel G
2011 IEEE 26th Annual Symposium on Logic in Computer Science., 409-418.
01-06-2011
2010
On the expressivity of symmetry in event structures **Dedicated to the memory of Robin MilnerStaton S Winskel G
2010 25th Annual IEEE Symposium on Logic in Computer Science., 392-401.
01-07-2010
2009
Prime algebraicityWinskel G
Theoretical Computer Science, Elsevier vol. 410 (41), 4160-4168.
01-09-2009
Events, Causality and SymmetryWinskel G
The Computer Journal, Oxford University Press (OUP) vol. 54 (1), 42-57.
05-06-2009
Editors' note: bibliometrics and the curators of orthodoxyMathematical Structures in Computer Science, Cambridge University Press (Cup) vol. 19 (1), 1-4.
01-02-2009
Nominal Domain Theory for ConcurrencyTurner D Winskel G
Lecture Notes in Computer Science. vol. 5771, 546-560.
01-01-2009
2008
The unfolding of general Petri netsHayman J Winskel G
Leibniz International Proceedings in Informatics Lipics. vol. 2, 223-234.
01-12-2008
Independence and concurrent separation logicHayman J Winskel G
Logical Methods in Computer Science, Centre Pour La Communication Scientifique Directe (Ccsd) vol. Volume 4, Issue 1
19-03-2008
Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process AlgebraBoudol G Castellani I Hennessy M Nielsen M Winskel G
Lecture Notes in Computer Science. vol. 5065, 757-777.
01-01-2008
2007
The cartesian closed bicategory of generalised species of structuresFiore M Gambino N Hyland M Winskel G
Journal of The London Mathematical Society, Wiley vol. 77 (1), 203-220.
20-10-2007
Event Structure Spans for Nondeterministic DataflowSaunders-Evans L Winskel G
Electronic Notes in Theoretical Computer Science, Elsevier vol. 175 (3), 109-129.
01-06-2007
Event Structures with SymmetryWinskel G
Electronic Notes in Theoretical Computer Science, Elsevier vol. 172, 611-652.
01-04-2007
PrefaceCardelli L Fiore M Winskel G
Electronic Notes in Theoretical Computer Science, Elsevier vol. 172, 1-4.
01-04-2007
Symmetry and ConcurrencyWinskel G
Lecture Notes in Computer Science. vol. 4624, 40-64.
01-01-2007
2006
Probabilistic event structures and domainsVaracca D Völzer H Winskel G
Theoretical Computer Science, Elsevier vol. 358 (2-3), 173-199.
01-08-2006
Distributing probability over non-determinismVARACCA D WINSKEL G
Mathematical Structures in Computer Science, Cambridge University Press (Cup) vol. 16 (1), 87-113.
01-02-2006
Independence and Concurrent Separation LogicHayman J Winskel G
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)., 147-156.
01-01-2006
2005
Name generation and linearityWinskel G
Proceedings Symposium on Logic in Computer Science., 301-310.
25-10-2005
Relations in concurrencyWinskel G
Proceedings Symposium on Logic in Computer Science., 2-11.
25-10-2005
Profunctors, open maps and bisimulationCATTANI GL WINSKEL G
Mathematical Structures in Computer Science. vol. 15 (3), 553-614.
27-05-2005
Limit Preservation from NaturalityCaccamo M Winskel G
Electronic Notes in Theoretical Computer Science. vol. 122, 3-22.
01-03-2005
Petri Nets With PersistenceCrazzolara F Winskel G
Electronic Notes in Theoretical Computer Science. vol. 121, 143-155.
01-02-2005
2004
A relational model of non-deterministic dataflowHILDEBRANDT TT PANANGADEN P WINSKEL G
Mathematical Structures in Computer Science, Cambridge University Press (Cup) vol. 14 (5), 613-649.
23-09-2004
Domain theory for concurrencyNygaard M Winskel G
Theoretical Computer Science. vol. 316 (1-3), 153-190.
01-05-2004
New-HOPLA a higher-order process language with name generationWinskel G Nardelli FZ
IFIP Advances in Information and Communication Technology. vol. 155, 521-534.
01-01-2004
Probabilistic Event Structures and DomainsVaracca D Völzer H Winskel G
Lecture Notes in Computer Science, Springer Nature vol. 3170, 481-496.
01-01-2004
2003
Presheaf models for CCS-like languagesCattani GL Winskel G
Theoretical Computer Science, Elsevier vol. 300 (1-3), 47-89.
01-05-2003
Full Abstraction for HOPLANygaard M Winskel G
Lecture Notes in Computer Science, Springer Nature vol. 2761, 383-398.
01-01-2003
2002
GUEST EDITORIALWinskel G
Information and Computation. vol. 179 (2)
01-12-2002
Linearity in process languagesNygaard M Winskel G
Proceedings 17th Annual IEEE Symposium on Logic in Computer Science., 433-444.
01-01-2002
HOPLA—A Higher-Order Process LanguageNygaard M Winskel G
Lecture Notes in Computer Science. vol. 2421, 434-448.
01-01-2002
Composing Strand SpacesCrazzolara F Winskel G
Lecture Notes in Computer Science. vol. 2556, 97-108.
01-01-2002
2001
Events in security protocolsCrazzolara F Winskel G
Proceedings of the 8th ACM conference on Computer and Communications Security., 96-105.
05-11-2001
A Higher-Order Calculus for CategoriesCáccamo M Winskel G
Lecture Notes in Computer Science. vol. 2152, 136-153.
01-01-2001
Petri nets in cryptographic protocolsCrazzolara F Winskel G
Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001., 1507-1515.
01-01-2001
2000
A representation result for free cocompletionsPower AJ Cattani GL Winskel G
Journal of Pure and Applied Algebra, Elsevier vol. 151 (3), 273-286.
01-08-2000
1999
Event Structures as Presheaves—Two Representation TheoremsWinskel G
Lecture Notes in Computer Science. vol. 1664, 541-556.
01-01-1999
Weak bisimulation and open mapsFiore M Cattani GL Winskel G
Proceedings Symposium on Logic in Computer Science, 67-76.
01-01-1999
1998
ForewordLarsen KG Skyum S Winskel G
Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics vol. 1443 LNCS
01-12-1998
A Linear Metalanguage for ConcurrencyWinskel G
Lecture Notes in Computer Science. vol. 1548, 42-58.
01-01-1998
A theory of recursive domains with applications to concurrencyCattani GL Fiore M Winskel G
Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226)., 214-225.
01-01-1998
A categorical axiomatics for bisimulationCattani GL Power J Winskel G
Lecture Notes in Computer Science. vol. 1466, 581-596.
01-01-1998
A relational model of non-deterministic dataflowHildebrandt T Panangaden P Winskel G
Lecture Notes in Computer Science. vol. 1466, 613-628.
01-01-1998
An Operational Understanding of Bisimulation from Open MapsWinskel G
Electronic Notes in Theoretical Computer Science. vol. 10
01-01-1998
1997
Completeness results for linear logic on Petri netsEngberg U Winskel G
Annals of Pure and Applied Logic, Elsevier vol. 86 (2), 101-135.
01-06-1997
Presheaf models for concurrencyCattani GL Winskel G
Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics. vol. 1258, 59-75.
01-01-1997
Presheaf models for concurrencyCattani GL Winskel G
In Computer Science Logic, Springer Nature 58-75.
01-01-1997
Presheaf models for the π-calculusCattani GL Stark I Winskel G
Lecture Notes in Computer Science. vol. 1290, 106-126.
01-01-1997
1996
Models for concurrency: Towards a classificationSassone V Nielsen M Winskel G
Theoretical Computer Science vol. 170 (1-2), 297-348.
01-12-1996
Models for concurrency: towards a classificationSassone V Nielsen M Winskel G
Theoretical Computer Science, Elsevier vol. 170 (1-2), 297-348.
01-12-1996
Bisimulation from Open MapsJoyal A Nielsen M Winskel G
Information and Computation, Elsevier vol. 127 (2), 164-185.
01-06-1996
A presheaf semantics of value-passing processes (Extended abstract)Winskel G
Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics. vol. 1119, 98-114.
01-01-1996
A presheaf semantics of value-passing processesWinskel G
In Concur '96: Concurrency Theory, Springer Nature 98-114.
01-01-1996
Petri nets and bisimulationNielsen M Winskel G
Theoretical Computer Science, Elsevier vol. 153 (1-2), 211-244.
01-01-1996
1995
CCS with Priority ChoiceCamilleri J Winskel G
Information and Computation, Elsevier vol. 116 (1), 26-37.
01-01-1995
1994
Stable bistructure models of PCFWinskel G
Lecture Notes in Computer Science. vol. 841, 177-197.
01-01-1994
Linear logic on Petri netsEngberg U Winskel G
Lecture Notes in Computer Science. vol. 803, 176-229.
01-01-1994
Bistructures, bidomains and linear logicPlotkin G Winskel G
Lecture Notes in Computer Science. vol. 820, 352-363.
01-01-1994
Compositional proof system for the modal μ-calculusAndersen HR Stirling C Winskel G
Proceedings Symposium on Logic in Computer Science., 144-153.
01-01-1994
Relationships between models of concurrencyNielsen M Sassone V Winskel G
Lecture Notes in Computer Science. vol. 803, 425-476.
01-01-1994
1993
Completeness results for linear logic on Petri netsEngberg U Winskel G
Lecture Notes in Computer Science. vol. 711, 442-452.
01-01-1993
A classification of models for concurrencySassone V Nielsen M Winskel G
Lecture Notes in Computer Science. vol. 715, 82-96.
01-01-1993
Bisimulation and open mapsJoyal A Nielsen M Winskel G
Proceedings Symposium on Logic in Computer Science., 418-427.
01-01-1993
Deterministic behavioural models for concurrencySassone V Nielsen M Winskel G
Lecture Notes in Computer Science. vol. 711, 682-692.
01-01-1993
1992
Compositional checking of satisfactionAndersen HR Winskel G
Formal Methods in System Design, Springer Nature vol. 1 (4), 323-354.
01-12-1992
Compositional checking of satisfactionAndersen HR Winskel G
Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics. vol. 575 LNCS, 25-36.
01-01-1992
Compositional checking of satisfactionAndersen HR Winskel G
In Computer Aided Verification, Springer Nature 24-36.
01-01-1992
1991
CCS with priority choiceCamilleri J Winskel G
Proceedings Symposium on Logic in Computer Science., 246-255.
01-07-1991
A note on model checking the modal ν-calculusWinskel G
Theoretical Computer Science, Elsevier vol. 83 (1), 157-167.
01-06-1991
Using information systems to solve recursive domain equationsLarsen KG Winskel G
Information and Computation, Elsevier vol. 91 (2), 232-258.
01-04-1991
Petri nets and transition systemsWinskel G
Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics. vol. 560 LNCS
01-01-1991
1990
A compositional proof system on a category of labelled transition systemsWinskel G
Information and Computation, Elsevier vol. 87 (1-2), 2-57.
01-07-1990
On the compositional checking of validity: (extended abstract)Winskel G
Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics. vol. 458 LNCS, 481-501.
01-01-1990
On the compositional checking of validityWinskel G
In Concur '90 Theories of Concurrency: Unification and Extension, Springer Nature 481-501.
01-01-1990
Petri nets as models of linear logicEngberg U Winskel G
Lecture Notes in Computer Science. vol. 431, 147-161.
01-01-1990
1989
Domain theoretic models of polymorphismCoquand T Gunter C Winskel G
Information and Computation, Elsevier vol. 81 (2), 123-167.
01-05-1989
An introduction to event structuresWinskel G
Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics. vol. 354 LNCS, 364-397.
01-01-1989
An introduction to event structuresWinskel G
In Linear Time, Branching Time and Partial Order in Logics and Models For Concurrency, Springer Nature 364-397.
01-01-1989
A note on model checking the modal v-calculusWinskel G
Lecture Notes in Computer Science. vol. 372, 761-772.
01-01-1989
1988
Category of labelled petri nets and compositional proof system.Winskel G
undefined., 142-154.
01-12-1988
dI-domains as a model of polymorphismCoquand T Gunter C Winskel G
Lecture Notes in Computer Science. vol. 298, 344-363.
01-01-1988
1987
Petri nets, algebras, morphisms, and compositionalityWinskel G
Information and Computation, Elsevier vol. 72 (3), 197-238.
01-03-1987
Event structuresWinskel G
Lecture Notes in Computer Science. vol. 255, 325-392.
01-01-1987
Relating two models of hardwareWinskel G
Lecture Notes in Computer Science. vol. 283, 98-113.
01-01-1987
1986
Category theory and models for parallel computationWinskel G
Lecture Notes in Computer Science. vol. 240, 266-281.
01-01-1986
1985
A complete proof system for SCCS with modal assertions: Extended abstractWinskel G
Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics. vol. 206 LNCS, 392-410.
01-01-1985
On the composition and decomposition of assertionsWinskel G
Lecture Notes in Computer Science. vol. 197, 62-75.
01-01-1985
On powerdomains and modalityWinskel G
Theoretical Computer Science, Elsevier vol. 36, 127-137.
01-01-1985
A complete proof system for SCCS with modal assertionsWinskel G
In Foundations of Software Technology and Theoretical Computer Science, Springer Nature 392-410.
01-01-1985
Categories of models for concurrencyWinskel G
Lecture Notes in Computer Science. vol. 197, 246-267.
01-01-1985
1984
A new definition of morphism on Petri netsWinskel G
Lecture Notes in Computer Science. vol. 166, 140-150.
01-01-1984
Synchronization treesWinskel G
Theoretical Computer Science, Elsevier vol. 34 (1-2), 33-82.
01-01-1984
Using information systems to solve reoursive domain equations effectivelyLarsen KG Winskel G
Lecture Notes in Computer Science. vol. 173, 109-129.
01-01-1984
1983
Synchronisation treesWinskel G
Lecture Notes in Computer Science. vol. 154, 695-711.
01-01-1983
A note on powerdomains and modalityWinskel G
Lecture Notes in Computer Science. vol. 158, 505-514.
01-01-1983
1982
Event structure semantics for CCS and related languagesWinskel G
Lecture Notes in Computer Science. vol. 140, 561-576.
01-01-1982
1981
Petri nets, event structures and domains, part INielsen M Plotkin G Winskel G
Theoretical Computer Science, Elsevier vol. 13 (1), 85-108.
01-01-1981
1979
Petri nets, event structures and domainsNielsen M Plotkin G Winskel G
Lecture Notes in Computer Science. vol. 70, 266-284.
01-01-1979
News
No news items found.