Glynn Winskel

Vincent Danos, Russell Harmer, Glynn Winskel: Constraining rule-based dynamics with types. Mathematical Structures in Computer Science 23(2): 272-289 (2013)

Glynn Winskel: Strategies as Profunctors. FoSSaCS 2013: 418-433

Christopher D. Thompson-Walsh, Jonathan Hayman, Glynn Winskel: Containment in Rule-Based Models. Electr. Notes Theor. Comput. Sci. 284: 125-137 (2012)

Glynn Winskel: Deterministic concurrent strategies. Formal Asp. Comput. 24(4-6): 647-660 (2012)

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

Glynn Winskel: Bicategories of Concurrent Games - (Invited Paper). FoSSaCS 2012: 26-41

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

Pierre Clairambault, Julian Gutierrez, Glynn Winskel: The Winning Ways of Concurrent Games. LICS 2012: 235-244

Glynn Winskel: Events, Causality and Symmetry. Comput. J. 54(1): 42-57 (2011)

Silvain Rideau, Glynn Winskel: Concurrent Strategies. LICS 2011: 409-418

Sam Staton, Glynn Winskel: On the Expressivity of Symmetry in Event Structures. LICS 2010: 392-401

Glynn Winskel: Prime algebraicity. Theor. Comput. Sci. 410(41): 4160-4168 (2009)

David Turner, Glynn Winskel: Nominal Domain Theory for Concurrency. CSL 2009: 546-560

Jonathan Hayman, Glynn Winskel: Independence and Concurrent Separation Logic. Logical Methods in Computer Science 4(1) (2008)

Glynn Winskel: Events, Causality and Symmetry. BCS Int. Acad. Conf. 2008: 111-127

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

Jonathan Hayman, Glynn Winskel: The unfolding of general Petri nets. FSTTCS 2008: 223-234

Jonathan Hayman, Glynn Winskel: Independence and Concurrent Separation Logic. CoRR abs/0802.0820 (2008)

Luca Cardelli, Marcelo P. Fiore, Glynn Winskel: Preface. Electr. Notes Theor. Comput. Sci. 172: 1-4 (2007)

Glynn Winskel: Event Structures with Symmetry. Electr. Notes Theor. Comput. Sci. 172: 611-652 (2007)

Lucy Saunders-Evans, Glynn Winskel: Event Structure Spans for Nondeterministic Dataflow. Electr. Notes Theor. Comput. Sci. 175(3): 109-129 (2007)

Glynn Winskel: Symmetry and Concurrency. CALCO 2007: 40-64

Daniele Varacca, Glynn Winskel: Distributing probability over non-determinism. Mathematical Structures in Computer Science 16(1): 87-113 (2006)

Daniele Varacca, Hagen Völzer, Glynn Winskel: Probabilistic event structures and domains. Theor. Comput. Sci. 358(2-3): 173-199 (2006)

Jonathan Hayman, Glynn Winskel: Independence and Concurrent Separation Logic. LICS 2006: 147-156

Federico Crazzolara, Glynn Winskel: Petri Nets With Persistence. Electr. Notes Theor. Comput. Sci. 121: 143-155 (2005)

Mario Cáccamo, Glynn Winskel: Limit Preservation from Naturality. Electr. Notes Theor. Comput. Sci. 122: 3-22 (2005)

Gian Luca Cattani, Glynn Winskel: Profunctors, open maps and bisimulation. Mathematical Structures in Computer Science 15(3): 553-614 (2005)

Glynn Winskel: Relations in Concurrency. LICS 2005: 2-11

Glynn Winskel: Name Generation and Linearity. LICS 2005: 301-310

Thomas T. Hildebrandt, Prakash Panangaden, Glynn Winskel: A relational model of non-deterministic dataflow. Mathematical Structures in Computer Science 14(5): 613-649 (2004)

Mikkel Nygaard, Glynn Winskel: Domain theory for concurrency. Theor. Comput. Sci. 316(1): 153-190 (2004)

Daniele Varacca, Hagen Völzer, Glynn Winskel: Probabilistic Event Structures and Domains. CONCUR 2004: 481-496

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

Gian Luca Cattani, Glynn Winskel: Presheaf models for CCS-like languages. Theor. Comput. Sci. 300(1-3): 47-89 (2003)

Mikkel Nygaard, Glynn Winskel: Full Abstraction for HOPLA. CONCUR 2003: 378-392

Glynn Winskel: Guest Editorial. Inf. Comput. 179(2): 151 (2002)

Mikkel Nygaard, Glynn Winskel: HOPLA-A Higher-Order Process Language. CONCUR 2002: 434-448

Glynn Winskel: Calculus for categories. FICS 2002: 1

Federico Crazzolara, Glynn Winskel: Composing Strand Spaces. FSTTCS 2002: 97-108

Mikkel Nygaard, Glynn Winskel: Linearity in Process Languages. LICS 2002: 433-

Federico Crazzolara, Glynn Winskel: Events in security protocols. ACM Conference on Computer and Communications Security 2001: 96-105

Federico Crazzolara, Glynn Winskel: Petri nets in cryptographic protocols. IPDPS 2001: 149

Mario Cáccamo, Glynn Winskel: A Higher-Order Calculus for Categories. TPHOLs 2001: 136-153

Carsten Butz, Ulrich Kohlenbach, Søren Riis, Glynn Winskel: Preface. Ann. Pure Appl. Logic 104(1-3): 1-2 (2000)

Pierre-Louis Curien, Gordon D. Plotkin, Glynn Winskel: Bistructures, bidomains, and linear logic. Proof, Language, and Interaction 2000: 21-54

Glynn Winskel: Event Structures as Presheaves -Two Representation Theorems. CONCUR 1999: 541-556

Marcelo P. Fiore, Gian Luca Cattani, Glynn Winskel: Weak Bisimulation and Open Maps. LICS 1999: 67-76

Glynn Winskel: A Linear Metalanguage for Concurrency. AMAST 1998: 42-58

Gian Luca Cattani, John Power, Glynn Winskel: A Categorical Axiomatics for Bisimulation. CONCUR 1998: 581-596

Thomas T. Hildebrandt, Prakash Panangaden, Glynn Winskel: A Relational Model of Non-deterministic Dataflow. CONCUR 1998: 613-628

Gian Luca Cattani, Marcelo P. Fiore, Glynn Winskel: A Theory of Recursive Domains with Applications to Concurrency. LICS 1998: 214-225

Kim Guldstrand Larsen, Sven Skyum, Glynn Winskel (Eds.): Automata, Languages and Programming, 25th International Colloquium, ICALP'98, Aalborg, Denmark, July 13-17, 1998, Proceedings. Lecture Notes in Computer Science 1443, Springer 1998, isbn 3-540-64781-3

Uffe Engberg, Glynn Winskel: Completeness Results for Linear Logic on Petri Nets. Ann. Pure Appl. Logic 86(2): 101-135 (1997)

Glynn Winskel: An Operational Understanding of Bisimulation from Open Maps. Electr. Notes Theor. Comput. Sci. 10: 50 (1997)

Gian Luca Cattani, Ian Stark, Glynn Winskel: Presheaf Models for the pi-Calculus. Category Theory and Computer Science 1997: 106-126

André Joyal, Mogens Nielsen, Glynn Winskel: Bisimulation from Open Maps. Inf. Comput. 127(2): 164-185 (1996)

Mogens Nielsen, Glynn Winskel: Petri Nets and Bisimulation. Theor. Comput. Sci. 153(1&2): 211-244 (1996)

Vladimiro Sassone, Mogens Nielsen, Glynn Winskel: Models for Concurrency: Towards a Classification. Theor. Comput. Sci. 170(1-2): 297-348 (1996)

Glynn Winskel: A Presheaf Semantics of Value-Passing Processes. CONCUR 1996: 98-114

Gian Luca Cattani, Glynn Winskel: Presheaf Models for Concurrency. CSL 1996: 58-75

Juanito Camilleri, Glynn Winskel: CCS with Priority Choice. Inf. Comput. 116(1): 26-37 (1995)

Gordon D. Plotkin, Glynn Winskel: Bistructures, Bidomains and Linear Logic. ICALP 1994: 352-363

Henrik Reif Andersen, Colin Stirling, Glynn Winskel: A Compositional Proof System for the Modal mu-Calculus. LICS 1994: 144-153

Glynn Winskel: Stable Bistructure Models of PCF. MFCS 1994: 177-197

Glynn Winskel: The formal semantics of programming languages - an introduction. Foundation of computing series, MIT Press 1993, isbn 978-0-262-23169-5, pp. I-XVIII, 1-361

Vladimiro Sassone, Mogens Nielsen, Glynn Winskel: A Classification of Models for Concurrency. CONCUR 1993: 82-96

André Joyal, Mogens Nielsen, Glynn Winskel: Bisimulation and open maps. LICS 1993: 418-427

Uffe Engberg, Glynn Winskel: Completeness Results for Linear Logic on Petri Nets. MFCS 1993: 442-452

Vladimiro Sassone, Mogens Nielsen, Glynn Winskel: Deterministic Behavioural Models for Concurrency. MFCS 1993: 682-692

Uffe Engberg, Glynn Winskel: Linear Logic on Petri Nets. REX School/Symposium 1993: 176-229

Mogens Nielsen, Vladimiro Sassone, Glynn Winskel: Relationships Between Models of Concurrency. REX School/Symposium 1993: 425-476

Henrik Reif Andersen, Glynn Winskel: Compositional Checking of Satsfaction. Formal Methods in System Design 1(4): 323-354 (1992)

Kim Guldstrand Larsen, Glynn Winskel: Using Information Systems to Solve Recursive Domain Equations. Inf. Comput. 91(2): 232-258 (1991)

Glynn Winskel: A Note on Model Checking the Modal nu-Calculus. Theor. Comput. Sci. 83(1): 157-167 (1991)

Henrik Reif Andersen, Glynn Winskel: Compositional Checking of Satisfaction. CAV 1991: 24-36

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

Juanito Camilleri, Glynn Winskel: CCS with Priority Choice. LICS 1991: 246-255

Glynn Winskel: A Compositional Proof System on a Category of Labelled Transition Systems. Inf. Comput. 87(1/2): 2-57 (1990)

Uffe Engberg, Glynn Winskel: Petri Nets as Models of Linear Logic. CAAP 1990: 147-161

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

Thierry Coquand, Carl A. Gunter, Glynn Winskel: Domain Theoretic Models of Polymorphism. Inf. Comput. 81(2): 123-167 (1989)

Glynn Winskel: A Note on Model Checking the Modal nu-Calculus. ICALP 1989: 761-772

Glynn Winskel: A Category of Labelled Petri Nets and Compositional Proof System (Extended Abstract). LICS 1988: 142-154

Glynn Winskel: An introduction to event structures. REX Workshop 1988: 364-397

Glynn Winskel: Petri Nets, Algebras, Morphisms, and Compositionality. Inf. Comput. 72(3): 197-238 (1987)

Glynn Winskel: Relating Two Models of Hardware. Category Theory and Computer Science 1987: 98-113

Thierry Coquand, Carl A. Gunter, Glynn Winskel: DI-Domains as a Model of Polymorphism. MFPS 1987: 344-363

Glynn Winskel: Event Structures. Advances in Petri Nets 1986: 325-392

Glynn Winskel: On Powerdomains and Modality. Theor. Comput. Sci. 36: 127-137 (1985)

Glynn Winskel: Petri nets, morphisms and compositionality. Applications and Theory in Petri Nets 1985: 453-477

Glynn Winskel: Category Theory and Models for Parallel Computation. CTCS 1985: 266-281

Glynn Winskel: A Complete System for SCCS with Modal Assertions. FSTTCS 1985: 392-410

Stephen D. Brookes, A. W. Roscoe, Glynn Winskel (Eds.): Seminar on Concurrency, Carnegie-Mellon University, Pittsburg, PA, USA, July 9-11, 1984. Lecture Notes in Computer Science 197, Springer 1985, isbn 3-540-15670-4

Glynn Winskel: Synchronization Trees. Theor. Comput. Sci. 34: 33-82 (1984)

Glynn Winskel: On the Composition and Decomposition of Assertions. Seminar on Concurrency 1984: 62-75

Glynn Winskel: Categories of Models for Concurrency. Seminar on Concurrency 1984: 246-267

Glynn Winskel, Kim Guldstrand Larsen: Using Information Systems to Solve Recursive Domain Equations Effectively. Semantics of Data Types 1984: 109-129

Glynn Winskel: A New Definition of Morphism on Petri Nets. STACS 1984: 140-150

Glynn Winskel: A Note on Powerdomains and Modalitiy. FCT 1983: 505-514

Glynn Winskel: Synchronisation Trees. ICALP 1983: 695-711

Glynn Winskel: Event Structure Semantics for CCS and Related Languages. ICALP 1982: 561-576

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

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

Mogens Nielsen, Gordon D. Plotkin, Glynn Winskel: Petri Nets, Event Structures and Domains. Semantics of Concurrent Computation 1979: 266-284