dblp.uni-trier.dewww.uni-trier.de

Glynn Winskel Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
93EEDavid Turner, Glynn Winskel: Nominal Domain Theory for Concurrency. CSL 2009: 546-560
92EEGlynn Winskel: Prime algebraicity. Theor. Comput. Sci. 410(41): 4160-4168 (2009)
2008
91EEGlynn Winskel: Events, Causality and Symmetry. BCS Int. Acad. Conf. 2008: 111-127
90EEGé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
89EEJonathan Hayman, Glynn Winskel: The unfolding of general Petri nets. FSTTCS 2008
88EEJonathan Hayman, Glynn Winskel: Independence and Concurrent Separation Logic CoRR abs/0802.0820: (2008)
87EEJonathan Hayman, Glynn Winskel: Independence and Concurrent Separation Logic. Logical Methods in Computer Science 4(1): (2008)
2007
86EEGlynn Winskel: Symmetry and Concurrency. CALCO 2007: 40-64
85EELuca Cardelli, Marcelo P. Fiore, Glynn Winskel: Preface. Electr. Notes Theor. Comput. Sci. 172: 1-4 (2007)
84EEGlynn Winskel: Event Structures with Symmetry. Electr. Notes Theor. Comput. Sci. 172: 611-652 (2007)
83EELucy Saunders-Evans, Glynn Winskel: Event Structure Spans for Nondeterministic Dataflow. Electr. Notes Theor. Comput. Sci. 175(3): 109-129 (2007)
2006
82EEJonathan Hayman, Glynn Winskel: Independence and Concurrent Separation Logic. LICS 2006: 147-156
81EEDaniele Varacca, Glynn Winskel: Distributing probability over non-determinism. Mathematical Structures in Computer Science 16(1): 87-113 (2006)
80EEDaniele Varacca, Hagen Völzer, Glynn Winskel: Probabilistic event structures and domains. Theor. Comput. Sci. 358(2-3): 173-199 (2006)
2005
79EEGlynn Winskel: Relations in Concurrency. LICS 2005: 2-11
78EEGlynn Winskel: Name Generation and Linearity. LICS 2005: 301-310
77EEFederico Crazzolara, Glynn Winskel: Petri Nets With Persistence. Electr. Notes Theor. Comput. Sci. 121: 143-155 (2005)
76EEMario Cáccamo, Glynn Winskel: Limit Preservation from Naturality. Electr. Notes Theor. Comput. Sci. 122: 3-22 (2005)
75EEGian Luca Cattani, Glynn Winskel: Profunctors, open maps and bisimulation. Mathematical Structures in Computer Science 15(3): 553-614 (2005)
2004
74EEDaniele Varacca, Hagen Völzer, Glynn Winskel: Probabilistic Event Structures and Domains. CONCUR 2004: 481-496
73 Glynn Winskel, Francesco Zappa Nardelli: New-HOPLA: A Higher-order Process Language with Name Generation. IFIP TCS 2004: 521-534
72EEThomas T. Hildebrandt, Prakash Panangaden, Glynn Winskel: A relational model of non-deterministic dataflow. Mathematical Structures in Computer Science 14(5): 613-649 (2004)
71EEMikkel Nygaard, Glynn Winskel: Domain theory for concurrency. Theor. Comput. Sci. 316(1): 153-190 (2004)
2003
70EEMikkel Nygaard, Glynn Winskel: Full Abstraction for HOPLA. CONCUR 2003: 378-392
69EEGian Luca Cattani, Glynn Winskel: Presheaf models for CCS-like languages. Theor. Comput. Sci. 300(1-3): 47-89 (2003)
2002
68EEMikkel Nygaard, Glynn Winskel: HOPLA-A Higher-Order Process Language. CONCUR 2002: 434-448
67 Glynn Winskel: Calculus for categories. FICS 2002: 1
66EEFederico Crazzolara, Glynn Winskel: Composing Strand Spaces. FSTTCS 2002: 97-108
65EEMikkel Nygaard, Glynn Winskel: Linearity in Process Languages. LICS 2002: 433-
64EEGlynn Winskel: Guest Editorial. Inf. Comput. 179(2): 151 (2002)
2001
63EEFederico Crazzolara, Glynn Winskel: Events in security protocols. ACM Conference on Computer and Communications Security 2001: 96-105
62 Federico Crazzolara, Glynn Winskel: Petri nets in cryptographic protocols. IPDPS 2001: 149
61EEMario Cáccamo, Glynn Winskel: A Higher-Order Calculus for Categories. TPHOLs 2001: 136-153
2000
60 Pierre-Louis Curien, Gordon D. Plotkin, Glynn Winskel: Bistructures, bidomains, and linear logic. Proof, Language, and Interaction 2000: 21-54
59 Carsten Butz, Ulrich Kohlenbach, Søren Riis, Glynn Winskel: Preface. Ann. Pure Appl. Logic 104(1-3): 1-2 (2000)
1999
58EEGlynn Winskel: Event Structures as Presheaves -Two Representation Theorems. CONCUR 1999: 541-556
57EEMarcelo P. Fiore, Gian Luca Cattani, Glynn Winskel: Weak Bisimulation and Open Maps. LICS 1999: 67-76
1998
56 Kim Guldstrand Larsen, Sven Skyum, Glynn Winskel: Automata, Languages and Programming, 25th International Colloquium, ICALP'98, Aalborg, Denmark, July 13-17, 1998, Proceedings Springer 1998
55EEGlynn Winskel: A Linear Metalanguage for Concurrency. AMAST 1998: 42-58
54EEGian Luca Cattani, John Power, Glynn Winskel: A Categorical Axiomatics for Bisimulation. CONCUR 1998: 581-596
53EEThomas T. Hildebrandt, Prakash Panangaden, Glynn Winskel: A Relational Model of Non-deterministic Dataflow. CONCUR 1998: 613-628
52 Gian Luca Cattani, Marcelo P. Fiore, Glynn Winskel: A Theory of Recursive Domains with Applications to Concurrency. LICS 1998: 214-225
1997
51 Gian Luca Cattani, Ian Stark, Glynn Winskel: Presheaf Models for the pi-Calculus. Category Theory and Computer Science 1997: 106-126
50 Uffe Engberg, Glynn Winskel: Completeness Results for Linear Logic on Petri Nets. Ann. Pure Appl. Logic 86(2): 101-135 (1997)
49EEGlynn Winskel: An Operational Understanding of Bisimulation from Open Maps. Electr. Notes Theor. Comput. Sci. 10: (1997)
1996
48EEGlynn Winskel: A Presheaf Semantics of Value-Passing Processes. CONCUR 1996: 98-114
47EEGian Luca Cattani, Glynn Winskel: Presheaf Models for Concurrency. CSL 1996: 58-75
46 André Joyal, Mogens Nielsen, Glynn Winskel: Bisimulation from Open Maps. Inf. Comput. 127(2): 164-185 (1996)
45EEMogens Nielsen, Glynn Winskel: Petri Nets and Bisimulation. Theor. Comput. Sci. 153(1&2): 211-244 (1996)
44EEVladimiro Sassone, Mogens Nielsen, Glynn Winskel: Models for Concurrency: Towards a Classification. Theor. Comput. Sci. 170(1-2): 297-348 (1996)
1995
43 Juanito Camilleri, Glynn Winskel: CCS with Priority Choice Inf. Comput. 116(1): 26-37 (1995)
1994
42EEGordon D. Plotkin, Glynn Winskel: Bistructures, Bidomains and Linear Logic. ICALP 1994: 352-363
41 Henrik Reif Andersen, Colin Stirling, Glynn Winskel: A Compositional Proof System for the Modal mu-Calculus LICS 1994: 144-153
40EEGlynn Winskel: Stable Bistructure Models of PCF. MFCS 1994: 177-197
1993
39EEVladimiro Sassone, Mogens Nielsen, Glynn Winskel: A Classification of Models for Concurrency. CONCUR 1993: 82-96
38 André Joyal, Mogens Nielsen, Glynn Winskel: Bisimulation and open maps LICS 1993: 418-427
37EEUffe Engberg, Glynn Winskel: Completeness Results for Linear Logic on Petri Nets. MFCS 1993: 442-452
36EEVladimiro Sassone, Mogens Nielsen, Glynn Winskel: Deterministic Behavioural Models for Concurrency. MFCS 1993: 682-692
35EEUffe Engberg, Glynn Winskel: Linear Logic on Petri Nets. REX School/Symposium 1993: 176-229
34EEMogens Nielsen, Vladimiro Sassone, Glynn Winskel: Relationships Between Models of Concurrency. REX School/Symposium 1993: 425-476
1992
33 Henrik Reif Andersen, Glynn Winskel: Compositional Checking of Satsfaction. Formal Methods in System Design 1(4): 323-354 (1992)
1991
32EEHenrik Reif Andersen, Glynn Winskel: Compositional Checking of Satisfaction. CAV 1991: 24-36
31EEGlynn Winskel: Petri Nets and Transition Systems (Abstract for an invited talk). FSTTCS 1991: 420
30 Juanito Camilleri, Glynn Winskel: CCS with Priority Choice LICS 1991: 246-255
29 Kim Guldstrand Larsen, Glynn Winskel: Using Information Systems to Solve Recursive Domain Equations Inf. Comput. 91(2): 232-258 (1991)
28 Glynn Winskel: A Note on Model Checking the Modal nu-Calculus. Theor. Comput. Sci. 83(1): 157-167 (1991)
1990
27EEUffe Engberg, Glynn Winskel: Petri Nets as Models of Linear Logic. CAAP 1990: 147-161
26EEGlynn Winskel: On the Compositional Checking of Validity (Extended Abstract). CONCUR 1990: 481-501
25 Glynn Winskel: A Compositional Proof System on a Category of Labelled Transition Systems Inf. Comput. 87(1/2): 2-57 (1990)
1989
24EEGlynn Winskel: A Note on Model Checking the Modal nu-Calculus. ICALP 1989: 761-772
23 Thierry Coquand, Carl A. Gunter, Glynn Winskel: Domain Theoretic Models of Polymorphism Inf. Comput. 81(2): 123-167 (1989)
1988
22 Glynn Winskel: A Category of Labelled Petri Nets and Compositional Proof System (Extended Abstract) LICS 1988: 142-154
21EEGlynn Winskel: An introduction to event structures. REX Workshop 1988: 364-397
1987
20 Glynn Winskel: Relating Two Models of Hardware. Category Theory and Computer Science 1987: 98-113
19EEThierry Coquand, Carl A. Gunter, Glynn Winskel: DI-Domains as a Model of Polymorphism. MFPS 1987: 344-363
18 Glynn Winskel: Petri Nets, Algebras, Morphisms, and Compositionality Inf. Comput. 72(3): 197-238 (1987)
1986
17 Glynn Winskel: Event Structures. Advances in Petri Nets 1986: 325-392
1985
16 Stephen D. Brookes, A. W. Roscoe, Glynn Winskel: Seminar on Concurrency, Carnegie-Mellon University, Pittsburg, PA, USA, July 9-11, 1984 Springer 1985
15EEGlynn Winskel: Petri nets, morphisms and compositionality. Applications and Theory in Petri Nets 1985: 453-477
14 Glynn Winskel: Category Theory and Models for Parallel Computation. CTCS 1985: 266-281
13EEGlynn Winskel: A Complete System for SCCS with Modal Assertions. FSTTCS 1985: 392-410
12 Glynn Winskel: On Powerdomains and Modality. Theor. Comput. Sci. 36: 127-137 (1985)
1984
11EEGlynn Winskel: A New Definition of Morphism on Petri Nets. STACS 1984: 140-150
10 Glynn Winskel, Kim Guldstrand Larsen: Using Information Systems to Solve Recursive Domain Equations Effectively. Semantics of Data Types 1984: 109-129
9EEGlynn Winskel: Categories of Models for Concurrency. Seminar on Concurrency 1984: 246-267
8EEGlynn Winskel: On the Composition and Decomposition of Assertions. Seminar on Concurrency 1984: 62-75
7 Glynn Winskel: Synchronization Trees. Theor. Comput. Sci. 34: 33-82 (1984)
1983
6 Glynn Winskel: A Note on Powerdomains and Modalitiy. FCT 1983: 505-514
5EEGlynn Winskel: Synchronisation Trees. ICALP 1983: 695-711
1982
4EEGlynn Winskel: Event Structure Semantics for CCS and Related Languages. ICALP 1982: 561-576
1981
3 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
2 Mogens Nielsen, Gordon D. Plotkin, Glynn Winskel: Petri Nets, Event Structures and Domains, Part I. Theor. Comput. Sci. 13: 85-108 (1981)
1979
1 Mogens Nielsen, Gordon D. Plotkin, Glynn Winskel: Petri Nets, Event Structures and Domains. Semantics of Concurrent Computation 1979: 266-284

Coauthor Index

1Henrik Reif Andersen [32] [33] [41]
2Gérard Boudol [90]
3Stephen D. Brookes [16]
4Carsten Butz [59]
5Mario Cáccamo [61] [76]
6Juanito Camilleri [30] [43]
7Luca Cardelli [85]
8Ilaria Castellani [90]
9Gian Luca Cattani [47] [51] [52] [54] [57] [69] [75]
10Thierry Coquand [19] [23]
11Federico Crazzolara [62] [63] [66] [77]
12Pierre-Louis Curien [60]
13Uffe Engberg [27] [35] [37] [50]
14Marcelo P. Fiore [52] [57] [85]
15Carl A. Gunter [19] [23]
16Jonathan Hayman [82] [87] [88] [89]
17Matthew Hennessy [90]
18Thomas T. Hildebrandt [53] [72]
19André Joyal [38] [46]
20Ulrich Kohlenbach [59]
21Kim Guldstrand Larsen [10] [29] [56]
22Francesco Zappa Nardelli [73]
23Mogens Nielsen [1] [2] [34] [36] [38] [39] [44] [45] [46] [90]
24Mikkel Nygaard [65] [68] [70] [71]
25Prakash Panangaden [53] [72]
26Gordon D. Plotkin [1] [2] [42] [60]
27John Power (A. John Power) [54]
28Søren Riis [59]
29A. W. Roscoe (A. William Roscoe, Bill Roscoe) [16]
30Vladimiro Sassone [34] [36] [39] [44]
31Lucy Saunders-Evans [83]
32Sven Skyum [56]
33Ian Stark [51]
34Colin Stirling [41]
35David Turner [93]
36Daniele Varacca [74] [80] [81]
37Hagen Völzer [74] [80]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)