Search the dblp DataBase
Glynn Winskel :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Glynn Winskel Petri Nets, Algebras, Morphisms, and Compositionality [Citation Graph (1, 0)][DBLP ] Inf. Comput., 1987, v:72, n:3, pp:197-238 [Journal ] Mogens Nielsen , Gordon D. Plotkin , Glynn Winskel Petri Nets, Event Structures and Domains, Part I. [Citation Graph (1, 0)][DBLP ] Theor. Comput. Sci., 1981, v:13, n:, pp:85-108 [Journal ] Glynn Winskel On Powerdomains and Modality. [Citation Graph (1, 0)][DBLP ] Theor. Comput. Sci., 1985, v:36, n:, pp:127-137 [Journal ] Glynn Winskel A Note on Model Checking the Modal nu-Calculus. [Citation Graph (1, 0)][DBLP ] Theor. Comput. Sci., 1991, v:83, n:1, pp:157-167 [Journal ] Glynn Winskel Event Structures. [Citation Graph (0, 0)][DBLP ] Advances in Petri Nets, 1986, pp:325-392 [Conf ] Glynn Winskel A Linear Metalanguage for Concurrency. [Citation Graph (0, 0)][DBLP ] AMAST, 1998, pp:42-58 [Conf ] Glynn Winskel An Exercise in Processes with Infinite Pasts. [Citation Graph (0, 0)][DBLP ] Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets, 1981, pp:88-95 [Conf ] Glynn Winskel Petri nets, morphisms and compositionality. [Citation Graph (0, 0)][DBLP ] Applications and Theory in Petri Nets, 1985, pp:453-477 [Conf ] Uffe Engberg , Glynn Winskel Petri Nets as Models of Linear Logic. [Citation Graph (0, 0)][DBLP ] CAAP, 1990, pp:147-161 [Conf ] Henrik Reif Andersen , Glynn Winskel Compositional Checking of Satisfaction. [Citation Graph (0, 0)][DBLP ] CAV, 1991, pp:24-36 [Conf ] Federico Crazzolara , Glynn Winskel Events in security protocols. [Citation Graph (0, 0)][DBLP ] ACM Conference on Computer and Communications Security, 2001, pp:96-105 [Conf ] Gian Luca Cattani , John Power , Glynn Winskel A Categorical Axiomatics for Bisimulation. [Citation Graph (0, 0)][DBLP ] CONCUR, 1998, pp:581-596 [Conf ] Thomas T. Hildebrandt , Prakash Panangaden , Glynn Winskel A Relational Model of Non-deterministic Dataflow. [Citation Graph (0, 0)][DBLP ] CONCUR, 1998, pp:613-628 [Conf ] Mikkel Nygaard , Glynn Winskel HOPLA-A Higher-Order Process Language. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:434-448 [Conf ] Mikkel Nygaard , Glynn Winskel Full Abstraction for HOPLA. [Citation Graph (0, 0)][DBLP ] CONCUR, 2003, pp:378-392 [Conf ] Vladimiro Sassone , Mogens Nielsen , Glynn Winskel A Classification of Models for Concurrency. [Citation Graph (0, 0)][DBLP ] CONCUR, 1993, pp:82-96 [Conf ] Glynn Winskel On the Composition and Decomposition of Assertions. [Citation Graph (0, 0)][DBLP ] Seminar on Concurrency, 1984, pp:62-75 [Conf ] Glynn Winskel Categories of Models for Concurrency. [Citation Graph (0, 0)][DBLP ] Seminar on Concurrency, 1984, pp:246-267 [Conf ] Glynn Winskel On the Compositional Checking of Validity (Extended Abstract). [Citation Graph (0, 0)][DBLP ] CONCUR, 1990, pp:481-501 [Conf ] Glynn Winskel A Presheaf Semantics of Value-Passing Processes. [Citation Graph (0, 0)][DBLP ] CONCUR, 1996, pp:98-114 [Conf ] Glynn Winskel Event Structures as Presheaves -Two Representation Theorems. [Citation Graph (0, 0)][DBLP ] CONCUR, 1999, pp:541-556 [Conf ] Daniele Varacca , Hagen Völzer , Glynn Winskel Probabilistic Event Structures and Domains. [Citation Graph (0, 0)][DBLP ] CONCUR, 2004, pp:481-496 [Conf ] Gian Luca Cattani , Glynn Winskel Presheaf Models for Concurrency. [Citation Graph (0, 0)][DBLP ] CSL, 1996, pp:58-75 [Conf ] Gian Luca Cattani , Ian Stark , Glynn Winskel Presheaf Models for the pi-Calculus. [Citation Graph (0, 0)][DBLP ] Category Theory and Computer Science, 1997, pp:106-126 [Conf ] Glynn Winskel Category Theory and Models for Parallel Computation. [Citation Graph (0, 0)][DBLP ] CTCS, 1985, pp:266-281 [Conf ] Glynn Winskel Relating Two Models of Hardware. [Citation Graph (0, 0)][DBLP ] Category Theory and Computer Science, 1987, pp:98-113 [Conf ] Glynn Winskel A Note on Powerdomains and Modalitiy. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:505-514 [Conf ] Glynn Winskel Calculus for categories. [Citation Graph (0, 0)][DBLP ] FICS, 2002, pp:1- [Conf ] Federico Crazzolara , Glynn Winskel Composing Strand Spaces. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2002, pp:97-108 [Conf ] Glynn Winskel A Complete System for SCCS with Modal Assertions. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1985, pp:392-410 [Conf ] Glynn Winskel Petri Nets and Transition Systems (Abstract for an invited talk). [Citation Graph (0, 0)][DBLP ] FSTTCS, 1991, pp:420- [Conf ] Gordon D. Plotkin , Glynn Winskel Bistructures, Bidomains and Linear Logic. [Citation Graph (0, 0)][DBLP ] ICALP, 1994, pp:352-363 [Conf ] Glynn Winskel Event Structure Semantics for CCS and Related Languages. [Citation Graph (0, 0)][DBLP ] ICALP, 1982, pp:561-576 [Conf ] Glynn Winskel Synchronisation Trees. [Citation Graph (0, 0)][DBLP ] ICALP, 1983, pp:695-711 [Conf ] Glynn Winskel A Note on Model Checking the Modal nu-Calculus. [Citation Graph (0, 0)][DBLP ] ICALP, 1989, pp:761-772 [Conf ] Glynn Winskel , Francesco Zappa Nardelli New-HOPLA: A Higher-order Process Language with Name Generation. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2004, pp:521-534 [Conf ] Federico Crazzolara , Glynn Winskel Petri nets in cryptographic protocols. [Citation Graph (0, 0)][DBLP ] IPDPS, 2001, pp:149- [Conf ] Henrik Reif Andersen , Colin Stirling , Glynn Winskel A Compositional Proof System for the Modal mu-Calculus [Citation Graph (0, 0)][DBLP ] LICS, 1994, pp:144-153 [Conf ] Juanito Camilleri , Glynn Winskel CCS with Priority Choice [Citation Graph (0, 0)][DBLP ] LICS, 1991, pp:246-255 [Conf ] Gian Luca Cattani , Marcelo P. Fiore , Glynn Winskel A Theory of Recursive Domains with Applications to Concurrency. [Citation Graph (0, 0)][DBLP ] LICS, 1998, pp:214-225 [Conf ] Marcelo P. Fiore , Gian Luca Cattani , Glynn Winskel Weak Bisimulation and Open Maps. [Citation Graph (0, 0)][DBLP ] LICS, 1999, pp:67-76 [Conf ] Jonathan Hayman , Glynn Winskel Independence and Concurrent Separation Logic. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:147-156 [Conf ] André Joyal , Mogens Nielsen , Glynn Winskel Bisimulation and open maps [Citation Graph (0, 0)][DBLP ] LICS, 1993, pp:418-427 [Conf ] Mikkel Nygaard , Glynn Winskel Linearity in Process Languages. [Citation Graph (0, 0)][DBLP ] LICS, 2002, pp:433-0 [Conf ] Glynn Winskel Relations in Concurrency. [Citation Graph (0, 0)][DBLP ] LICS, 2005, pp:2-11 [Conf ] Glynn Winskel Name Generation and Linearity. [Citation Graph (0, 0)][DBLP ] LICS, 2005, pp:301-310 [Conf ] Glynn Winskel A Category of Labelled Petri Nets and Compositional Proof System (Extended Abstract) [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:142-154 [Conf ] Uffe Engberg , Glynn Winskel Completeness Results for Linear Logic on Petri Nets. [Citation Graph (0, 0)][DBLP ] MFCS, 1993, pp:442-452 [Conf ] Vladimiro Sassone , Mogens Nielsen , Glynn Winskel Deterministic Behavioural Models for Concurrency. [Citation Graph (0, 0)][DBLP ] MFCS, 1993, pp:682-692 [Conf ] Glynn Winskel Stable Bistructure Models of PCF. [Citation Graph (0, 0)][DBLP ] MFCS, 1994, pp:177-197 [Conf ] Thierry Coquand , Carl A. Gunter , Glynn Winskel DI-Domains as a Model of Polymorphism. [Citation Graph (0, 0)][DBLP ] MFPS, 1987, pp:344-363 [Conf ] Mogens Nielsen , Vladimiro Sassone , Glynn Winskel Relationships Between Models of Concurrency. [Citation Graph (0, 0)][DBLP ] REX School/Symposium, 1993, pp:425-476 [Conf ] Uffe Engberg , Glynn Winskel Linear Logic on Petri Nets. [Citation Graph (0, 0)][DBLP ] REX School/Symposium, 1993, pp:176-229 [Conf ] Glynn Winskel An introduction to event structures. [Citation Graph (0, 0)][DBLP ] REX Workshop, 1988, pp:364-397 [Conf ] Mogens Nielsen , Gordon D. Plotkin , Glynn Winskel Petri Nets, Event Structures and Domains. [Citation Graph (0, 0)][DBLP ] Semantics of Concurrent Computation, 1979, pp:266-284 [Conf ] Glynn Winskel , Kim Guldstrand Larsen Using Information Systems to Solve Recursive Domain Equations Effectively. [Citation Graph (0, 0)][DBLP ] Semantics of Data Types, 1984, pp:109-129 [Conf ] Glynn Winskel A New Definition of Morphism on Petri Nets. [Citation Graph (0, 0)][DBLP ] STACS, 1984, pp:140-150 [Conf ] Mario Cáccamo , Glynn Winskel A Higher-Order Calculus for Categories. [Citation Graph (0, 0)][DBLP ] TPHOLs, 2001, pp:136-153 [Conf ] Carsten Butz , Ulrich Kohlenbach , Søren Riis , Glynn Winskel Preface. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 2000, v:104, n:1-3, pp:1-2 [Journal ] Uffe Engberg , Glynn Winskel Completeness Results for Linear Logic on Petri Nets. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1997, v:86, n:2, pp:101-135 [Journal ] Mario Cáccamo , Glynn Winskel Limit Preservation from Naturality. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2005, v:122, n:, pp:3-22 [Journal ] Federico Crazzolara , Glynn Winskel Petri Nets With Persistence. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2005, v:121, n:, pp:143-155 [Journal ] Glynn Winskel An Operational Understanding of Bisimulation from Open Maps. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 1997, v:10, n:, pp:- [Journal ] Luca Cardelli , Marcelo P. Fiore , Glynn Winskel Preface. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2007, v:172, n:, pp:1-4 [Journal ] Glynn Winskel Event Structures with Symmetry. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2007, v:172, n:, pp:611-652 [Journal ] Henrik Reif Andersen , Glynn Winskel Compositional Checking of Satsfaction. [Citation Graph (0, 0)][DBLP ] Formal Methods in System Design, 1992, v:1, n:4, pp:323-354 [Journal ] Juanito Camilleri , Glynn Winskel CCS with Priority Choice [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1995, v:116, n:1, pp:26-37 [Journal ] Thierry Coquand , Carl A. Gunter , Glynn Winskel Domain Theoretic Models of Polymorphism [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1989, v:81, n:2, pp:123-167 [Journal ] André Joyal , Mogens Nielsen , Glynn Winskel Bisimulation from Open Maps. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1996, v:127, n:2, pp:164-185 [Journal ] Kim Guldstrand Larsen , Glynn Winskel Using Information Systems to Solve Recursive Domain Equations [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1991, v:91, n:2, pp:232-258 [Journal ] Glynn Winskel Guest Editorial. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2002, v:179, n:2, pp:151- [Journal ] Glynn Winskel A Compositional Proof System on a Category of Labelled Transition Systems [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1990, v:87, n:1/2, pp:2-57 [Journal ] Gian Luca Cattani , Glynn Winskel Profunctors, open maps and bisimulation. [Citation Graph (0, 0)][DBLP ] Mathematical Structures in Computer Science, 2005, v:15, n:3, pp:553-614 [Journal ] Thomas T. Hildebrandt , Prakash Panangaden , Glynn Winskel A relational model of non-deterministic dataflow. [Citation Graph (0, 0)][DBLP ] Mathematical Structures in Computer Science, 2004, v:14, n:5, pp:613-649 [Journal ] Gian Luca Cattani , Glynn Winskel Presheaf models for CCS-like languages. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:300, n:1-3, pp:47-89 [Journal ] Mogens Nielsen , Glynn Winskel Petri Nets and Bisimulation. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1996, v:153, n:1&2, pp:211-244 [Journal ] Mikkel Nygaard , Glynn Winskel Domain theory for concurrency. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2004, v:316, n:1, pp:153-190 [Journal ] Vladimiro Sassone , Mogens Nielsen , Glynn Winskel Models for Concurrency: Towards a Classification. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1996, v:170, n:1-2, pp:297-348 [Journal ] Daniele Varacca , Hagen Völzer , Glynn Winskel Probabilistic event structures and domains. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:358, n:2-3, pp:173-199 [Journal ] Glynn Winskel Synchronization Trees. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1984, v:34, n:, pp:33-82 [Journal ] Glynn Winskel Symmetry and Concurrency. [Citation Graph (0, 0)][DBLP ] CALCO, 2007, pp:40-64 [Conf ] Lucy Saunders-Evans , Glynn Winskel Event Structure Spans for Nondeterministic Dataflow. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2007, v:175, n:3, pp:109-129 [Journal ] Bistructures, bidomains, and linear logic. [Citation Graph (, )][DBLP ] Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra. [Citation Graph (, )][DBLP ] Nominal Domain Theory for Concurrency. [Citation Graph (, )][DBLP ] The unfolding of general Petri nets. [Citation Graph (, )][DBLP ] On the Expressivity of Symmetry in Event Structures. [Citation Graph (, )][DBLP ] Events, Causality and Symmetry. [Citation Graph (, )][DBLP ] Independence and Concurrent Separation Logic [Citation Graph (, )][DBLP ] Search in 0.010secs, Finished in 0.013secs