Glynn Winskel

1 Linearity and nonlinearity in distributed computation (2008)

Glynn Winskel

The copying of processes is limited in the context of distributed computation, either as a fact of life, often because remote networks are simply too complicated to have control over, or...

Purpose (2008)

Glynn Winskel

operational semantics

GDP Festschrift ENTCS, to appear Abstract Event Structures with Symmetry (2008)

Glynn Winskel

Applications to the event-structure semantics of higher order processes, nondeterministic dataflow and the unfolding of Petri nets with multiple tokens are sketched.

Symmetry and Concurrency (Extended Abstract) (2008)

Glynn Winskel

Abstract. A category of event structures with symmetry is introduced and its categorical properties investigated. Applications to the eventstructure semantics of higher order processes,...

GDP Festschrift ENTCS, to appear Abstract Event Structures with Symmetry (Extended Abstract) (2008)

Glynn Winskel

Applications to the event-structure semantics of higher order processes and the unfolding of Petri nets with multiple tokens are indicated.

EXPRESS 2006 Event Structure Spans for Nondeterministic (2008)

Lucy Saunders-evans, Glynn Winskel

A compositional semantics for nondeterministic dataflow processes is described using spans of event structures; such a span describes a computation between datatypes, themselves represented by event...

Abstract CTCS 2004 Preliminary Version Limit Preservation from Naturality (2008)

Mario Caccamo, Glynn Winskel

A functor G: C → D is said to preserve limits of a diagram D: I → C if it sends any limiting cone from x to D to a limiting cone from G(x) to G ◦ D. When G preserves limits of a diagram D this...

Abstract Probabilistic Event Structures and Domains (2008)

Daniele Varacca, Hagen Völzer, Glynn Winskel

This paper studies how to adjoin probability to event structures, leading to the model of probabilistic event structures. In their simplest form probabilistic choice is localised to cells, where...

Independence and concurrent separation logic (2008)

Hayman, Jonathan, Winskel, Glynn

A compositional Petri net-based semantics is given to a simple language allowing pointer manipulation and parallelism. The model is then applied to give a notion of validity to the judgements made by...

Theoretical Computer Science 13 (198 1) 85-l J8 @ North-I!olland Publishing Company (2008)

Mogens Nielsen, Gordon Flbtkin, Glynn Winskel

Abstract. The general aim of this paper is to find a theory of concurrency combining the approaches of Petri and Scott (and others). In part I we introduce our formalisms. To connect the abstract...

Topics in Concurrency Lecture Notes (2008)

Glynn Winskel, Glynn Winskel

Prerequisite courses: Semantics of Programming Languages Aims The aim of this course is to introduce fundamental concepts and techniquesin the theory of concurrent processes. It will provide...

The unfolding of general Petri nets (2008)

Hayman, Jonathan, Winskel, Glynn

The unfolding of (1-)safe Petri nets to occurrence nets is well understood. There is a universal characterization of the unfolding of a safe net which is part and parcel of a coreflection from the...

Aarhus University (2007)

Uffe Engberg, Glynn Winskel, Ny Munkegade

Completeness is shown for several versions of Girard's linear logic with respect to Petri nets as the class of models. The strongest logic considered is intuitionistic linear logic, with\Omega,...

Completeness Results for Linear Logic on Petri Nets (Extended Abstract) (2007)

Uffe Engberg, Glynn Winskel, Ny Munkegade

) Uffe Engberg Glynn Winskel Computer Science Department Aarhus University Ny Munkegade DK-8000 Aarhus C, Denmark Abstract Completeness is shown for several versions of Girard's linear logic...

Completeness Results for Linear Logic on Petri Nets (2007)

Exte Nd Ed, Uffe Engberg, Glynn Winskel, Ny Munkegade

) Uffe Engberg Glynn Winskel Computer Science Department Aarhus University Ny Munkegade DK-8000 Aarhus C, Denmark Abstract Completeness is shown for several versions of Girard's linear logic...

Bistructures, Bidomains and Linear Logic (2007)

Pierre-Louis Curien, Gordon Plotkin, Glynn Winskel, Glynn Winskel Brics

Bistructures are a generalisation of event structures which allow a representation of spaces of functions at higher types in an orderextensional setting. The partial order of causal dependency is...

A Theory of Recursive Domains with Applications to Concurrency (2007)

Exte Nd Ed, Gian Luca Cattani, Marcelo Fiore, Glynn Winskel

) Gian Luca Cattani 1 , Marcelo Fiore 2; , Glynn Winskel 1 1 BRICS y , University of Aarhus, Denmark 2 COGS, University of Sussex, UK Abstract We develop a 2-categorical theory for recursively...

Models For Concurrency (2007)

Draft Copy, Glynn Winskel, Mogens Nielsen

Contents 1 Introduction 3 2 Transition systems 8 2.1 A category of transition systems : : : : : : : : : : : : : : : : : : 8 2.2 Constructions on transition systems : : : : : : : : : : : : : : : : :...

DRAFT Domain Theory for Concurrency (2007)

Mikkel Nygaard, Glynn Winskel

A simple domain theory for concurrency is presented. Based on a categorical model of linear logic and associated comonads, it highlights the role of linearity in concurrent computation. Two choices...

1 (2007)

Mikkel Nygaard, Glynn Winskel

Abstract. A fully abstract denotational semantics for the higher-order process language HOPLA is presented. It characterises contextual and logical equivalence, the latter linking up with simulation....

Presheaf Models for the-Calculus (2007)

Gian Luca Cattani, Gian Luca Cattani, Ian Stark, Ian Stark, Glynn Winskel, Glynn Winskel

is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS Report Series publications. Copies may be...

Stable bistructure models of PCF Preliminary draft (2007)

Glynn Winskel, Glynn Winskel

is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent publications in the BRICS Report Series. Copies...

Relational Semantics of Non-Deterministic (2007)

Non-deterministic Dataflow, Thomas Troels Hildebrandt, Thomas Hildebrandt, Prakash Panangaden, Prakash Panangaden, Glynn Winskel, ...

is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS Report Series publications. Copies may be...

BRICS Basic Research in Computer Science A Presheaf Semantics of Value-Passing Processes (2007)

Glynn Winskel, Glynn Winskel

is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent publications in the BRICS Report Series. Copies...

Edinburgh, Scotland (2007)

Bistructures Bidomains, Gordon Plotkin, Gordon Plotkin, Glynn Winskel, Glynn Winskel

is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent publications in the BRICS Report Series. Copies...

1 (2007)

Mikkel Nygaard, Glynn Winskel

Abstract. A small but powerful language for higher-order nondeterministic processes is introduced. Its roots in a linear domain theory for concurrency are sketched though for the most part it lends...

1 (2007)

Gian Luca Cattani, Marcelo Fiore, Glynn Winskel

We develop a 2-categorical theory for recursively defined domains. In particular, we generalise the traditional approach based on order-theoretic structures to categorytheoretic ones. A motivation...

Abstract (2007)

C Glynn Winskel, Glynn Winskel, Glynn Winskel

new-HOPLA — a higher-order process language with name generation

Basic Research in Computer Science (2004)

Glynn Winskel, Copyright C, Glynn Winskel, Glynn Winskel

This paper introduces new-HOPLA, a concise but powerful language for higherorder nondeterministic processes with name generation. Its origins as a metalanguage for domain theory are sketched but for...

Basic Research in Computer Science (2004)

Profunctors Open Maps, Gian Luca Cattani, Glynn Winskel, Copyright C, Gian Luca Cattani, Glynn Winskel, ...

This paper studies fundamental connections between profunctors (i.e., distributors, or bimodules), open maps and bisimulation. In particular, it proves that a colimit preserving functor between...

This document in subdirectoryRS/04/22/ Profunctors, Open Maps and Bisimulation ∗ (2004)

Gian Luca Cattani, Glynn Winskel, Copyright C, Gian Luca Cattani, Glynn Winskel, Gian Luca Cattani, ...

Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS...

Probabilistic Event Structures and Domains Daniele Varacca (2004)

And Glynn Winskel, Daniele Varacca, Glynn Winskel

We investigate probability in the presence of causal dependence and independence. More precisely, we study the process model of probabilistic event structures. We characterise the "global...

New-HOPLA— A Higher-Order Process Language with Name Generation (2004)

Copyright C, Glynn Winskel, Glynn Winskel, Glynn Winskel

Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS...

Probabilistic event structures and domains (2004)

Daniele Varacca, Hagen Völzer, Glynn Winskel

Abstract. This paper studies how to adjoin probability to event structures, leading to the model of probabilistic event structures. In their simplest form probabilistic choice is localised to cells,...

New-HOPLA— A Higher-Order Process Language with Name Generation (2004)

Glynn Winskel

Abstract This paper introduces new-HOPLA, a concise but powerful language for higherorder nondeterministic processes with name generation. Its origins as a metalanguage for domain theory are sketched...

Domain theory for concurrency (2003)

Mikkel Nygaard, Glynn Winskel

A simple domain theory for concurrency is presented. Based on a categorical model of linear logic and associated comonads, it highlights the role of linearity in concurrent computation. Two choices...

Domain theory for concurrency (2003)

Mikkel Nygaard, Glynn Winskel

A simple domain theory for concurrency is presented. Based on a categorical model of linear logic and associated comonads, it highlights the role of linearity in concurrent computation. Two choices...

Full abstraction for HOPLA (2003)

Mikkel Nygaard, Glynn Winskel

Abstract. A fully abstract denotational semantics for the higher-order process language HOPLA is presented. It characterises contextual and logical equivalence, the latter linking up with simulation....

A Relational Model of Non-Deterministic Dataflow (2003)

Thomas T. Hildebrandt, Prakash Panangaden, Glynn Winskel

this paper includes work done on presenting models for concurrency as categories, as summarised in (Winskel and Nielsen, 1995). This enabled a sweeping definition of bisimulation based on open maps...

Full abstraction for HOPLA (2003)

Mikkel Nygaard, Glynn Winskel

Abstract. A fully abstract denotational semantics for the higher-order process language HOPLA is presented. It characterises contextual and logical equivalence, the latter linking up with simulation....

Domain theory for concurrency (2003)

Mikkel Nygaard, Glynn Winskel

A simple domain theory for concurrency is presented. Based on a categorical model of linear logic and associated comonads, it highlights the role of linearity in concurrent computation. Two choices...

Composing strand spaces (2002)

Federico Crazzolara, Glynn Winskel

Abstract. The strand space model for the analysis of security protocols is known to have some limitations in the patterns of nondeterminism it allows and in the ways in which strand spaces can be...

HOPLA—a higher-order process language (2002)

Mikkel Nygaard, Glynn Winskel

Abstract. A small but powerful language for higher-order nondeterministic processes is introduced. Its roots in a linear domain theory for concurrency are sketched though for the most part it lends...

HOPLA—a higher-order process language (2002)

Mikkel Nygaard, Glynn Winskel

Abstract. A small but powerful language for higher-order nondeterministic processes is introduced. Its roots in a linear domain theory for concurrency are sketched though for the most part it lends...

Linearity in process languages (2002)

Mikkel Nygaard, Glynn Winskel

The meaning and mathematical consequences of linearity (managing without a presumed ability to copy) are studied for a path-based model of processes which is also a model of affine-linear logic. This...

Linearity in process languages (2002)

Mikkel Nygaard, Glynn Winskel

The meaning and mathematical consequences of linearity (managing without a presumed ability to copy) are studied for a path-based model of processes which is also a model of affine-linear logic. This...

HOPLA—a higher-order process language (2002)

Mikkel Nygaard, Glynn Winskel

Abstract. A small but powerful language for higher-order nondeterministic processes is introduced. Its roots in a linear domain theory for concurrency are sketched though for the most part it lends...

Petri nets in Cryptographic protocols (2001)

Federico Crazzolara, Glynn Winskel

A process language for security protocols is presented together with a semantics in terms of sets of events. The denotation of process is a set of events, and as each event specifies a set of pre and...

Events in Security Protocols (2001)

Federico Crazzolara, Glynn Winskel

The events of a security protocol and their causal dependency can play an important role in the analysis of security properties. This insight underlies both strand spaces and the inductive method....

This document in subdirectoryRS/01/27/ A Higher-Order Calculus for Categories (2001)

Mario Jose Cáccamo, Glynn Winskel, Copyright C, Mario Jose Cáccamo, Glynn Winskel, Mario Cáccamo, ...

Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS...

Bistructures, Bidomains and Linear Logic (2000)

Curien, Pierre-Louis, Plotkin, Gordon, Winskel, Glynn

Bistructures are a generalisation of event structures which allow a representation of spaces of functions at higher types in an order-extensional setting. The partial order of causal dependency is...

Bistructures, Bidomains and Linear Logic (2000)

Curien, Pierre-Louis, Plotkin, Gordon, Winskel, Glynn

Bistructures are a generalisation of event structures which allow a representation of spaces of functions at higher types in an order- extensional setting. The partial order of causal dependency is...

i 1 Previous track record (2000)

Glynn Winskel, Marcelo Fiore, Glynn Winskel, Professor Computer Science

previously received research funding from the Royal Society, the EPSRC and various European programmes, and most significantly from the Danish Research Foundation to found BRICS. He is the author of...

Presheaf Models for Concurrency (1999)

Gian Luca Cattani, Gian Luca Cattani, Glynn Winskel, Glynn Winskel

is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent publications in the BRICS Report Series. Copies...

Towards a Categorical Axiomatics of Bisimulation (1999)

Gian Luca Cattani, A. John Power, Glynn Winskel

We give an axiomatic category theoretic account of bisimulation in process algebras based on the idea of functional bisimulations as open maps. The axiomatisation centres on 2-monads, T , on Cat....

Weak Bisimulation and Open Maps (Extended Abstract) (1999)

Marcelo Fiore, Gian Luca Cattani, Glynn Winskel

) In Proceedings of LICS '99, c IEEE Computer Society Marcelo Fiore COGS University of Sussex, UK Gian Luca Cattani Computer Laboratory University of Cambridge, UK Glynn Winskel BRICS y...

A Representation Result for Free Cocompletions (1999)

A. John Power, Gian Luca Cattani, Glynn Winskel

Given a class F of weights, one can consider the construction that takes a small category C to the free cocompletion of C under weighted colimits, for which the weight lies in F . Provided these free...

Event structures as presheaves---two representation theorems (1999)

Copyright C, Glynn Winskel, Glynn Winskel, Glynn Winskel

Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS...

Abstract (1999)

Gian Luca Cattani, Glynn Winskel, Copyright C, Gian Luca Cattani, Glynn Winskel, Gian Luca Cattani, ...

Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS...

Abstract (1999)

Marcelo P. Fiore, Gian Luca Cattani, Glynn Winskel, Copyright C, Marcelo P. Fiore, Gian Luca Cattani, ...

Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS...

Presheaf Models for Concurrency (1999)

Gian Luca Cattani, Gian Luca Cattani, Glynn Winskel, Glynn Winskel

is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent publications in the BRICS Report Series. Copies...

A Categorical Axiomatics for Bisimulation (1998)

Gian Luca Cattani, John Power, Glynn Winskel

. We give an axiomatic category theoretic account of bisimulation in process algebras based on the idea of functional bisimulations as open maps. We work with 2-monads, T , on Cat. Operations on...

A Relational Model of Non-Deterministic Dataflow (1998)

Thomas T. Hildebrandt, Prakash Panangaden, Glynn Winskel

. We recast dataflow in a modern categorical light using profunctors as a generalisation of relations. The well known causal anomalies associated with relational semantics of indeterminate dataflow...

A linear metalanguage for concurrency (1998)

Glynn Winskel, Glynn Winskel

is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS Report Series publications. Copies may be...

This document in subdirectoryRS/98/22/ A Categorical Axiomatics for Bisimulation (1998)

Gian Luca Cattani, John Power, Glynn Winskel, Gian Luca Cattani, John Power, Glynn Winskel

Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS...

This document in subdirectoryRS/98/21/ A Representation Result for Free (1998)

Free Cocompletions, John Power, Gian Luca Cattani, Glynn Winskel, John Power, Gian Luca Cattani, ...

Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS...

Categories in Concurrency (1997)

Glynn Winskel, Mogens Nielsen

These notes survey a range of models for parallel computation, including interleaving models like transition systems, synchronisation trees and languages (often called Hoare traces in this context),...

Presheaf Models for the pi-Calculus (1997)

Gian Luca Cattani, Ian Stark, Glynn Winskel

Recent work has shown that presheaf categories provide a general model of concurrency, with an inbuilt notion of bisimulation based on open maps. Here it is shown how this approach can also handle...

Presheaf Models for Concurrency (1997)

Gian Luca Cattani, Glynn Winskel

This paper studies presheaf models for concurrent computation. An aim is to harness the general machinery around presheaves for the purposes of process calculi. Traditional models like...

Presheaf Models for the π-Calculus (1997)

Gian Luca Cattani, Ian Stark, Glynn Winskel

Recent work has shown that presheaf categories provide a general model of concurrency, with an inbuilt notion of bisimulation based on open maps. Here it is shown how this approach can also handle...

This document in subdirectoryRS/97/35/ A Theory of Recursive Domains with Applications to Concurrency (Extended Abstract) (1997)

Gian Luca Cattani, Marcelo P. Fiore, Glynn Winskel, Gian Luca Cattani, Marcelo Fiore, Glynn Winskel

Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS...

This document in subdirectoryRS/97/34/ Presheaf Models for the π-Calculus (1997)

Gian Luca Cattani, Ian Stark, Glynn Winskel, Gian Luca Cattani, Ian Stark, Glynn Winskel

Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS...

Petri nets and bisimulation (1996)

Mogens Nielsen, Mogens Nielsen, Glynn Winskel, Glynn Winskel

is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent publications in the BRICS Report Series. Copies...

Bisimulation from open maps (1996)

Andr E Joyal, Mogens Nielsen, Mogens Nielsen, Glynn Winskel, Glynn Winskel

is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent publications in the BRICS Report Series. Copies...

Models for Concurrency: Towards a Classification (1996)

Vladimiro Sassone, Mogens Nielsen, Glynn Winskel

Models for concurrency can be classified with respect to three relevant parameters: behaviour/system, interleaving/noninterleaving, linear/branching time. When modelling a process, a choice...

Bisimulation from open maps (1996)

André Joyal, André Joyal, Mogens Nielsen, Mogens Nielsen, Glynn Winskel, Glynn Winskel

is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent publications in the BRICS Report Series. Copies...

Models for concurrency: Towards a classification (1996)

Vladimiro Sassone, Mogens Nielsen, Glynn Winskel

Models for concurrency can be classified with respect to three relevant parameters: behaviour/system, interleaving/noninterleaving, linear/branching time. When modelling a process, a choice...

Models for concurrency (1995)

Glynn Winskel, Glynn Winskel

is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS Report Series publications. Copies may be...

Abstract Theoretical Computer Science Models for concurrency: Towards a classification (1994)

Vladimiro Sassone, Mogens Nielsen, Glynn Winskel, Communicated G. Rozenberg

Models for concurrency can be classified with respect to three relevant parameters: behaviour/ system, interleaving/noninterleaving, linear/branching time. When modelling a process, a choice...

A compositional proof system for the modal -calculus (1994)

Henrik Reif Andersen, Henrik Reif Andersen, Colin Stirling, Colin Stirling, Glynn Winskel, Glynn Winskel

is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent publications in the BRICS Report Series. Copies...

A Compositional Proof System for the Modal (1994)

Calculus Henrik Reif, Henrik Reif Andersen, Colin Stirling, Glynn Winskel

We present a proof system for determining satisfaction between processes in a fairly general process algebra and assertions of the modal - calculus. The proof system is compositional in the structure...

Linear Logic on Petri Nets (1994)

Uffe H. Engberg, Uffe H. Engberg, Glynn Winskel, Glynn Winskel

. This article shows how individual Petri nets form models of Girard's intuitionistic linear logic. It explores questions of expressiveness and completeness of linear logic with respect to this...

A Compositional Proof System for the Modal µ-Calculus (1994)

Henrik Reif Andersen, Colin Stirling, Glynn Winskel

We present a proof system for determining satisfaction between processes in a fairly general process algebra and assertions of the modal ¯- calculus. The proof system is compositional in the...

Relationships between Models of Concurrency (1994)

Mogens Nielsen, Vladimiro Sassone, Glynn Winskel

. Models for concurrency can be classified with respect to three relevant parameters: behaviour/system, interleaving/noninterleaving, linear/branching time. When modelling a process, a choice...

A compositional proof system for the modal µ-calculus (1994)

Henrik Reif Andersen, Colin Stirling, Glynn Winskel, Henrik Reif, Andersen Colin, Stirling Glynn Winskel

Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS...

Bistructures, bidomains and linear logic (1994)

Pierre-louis Curien, Gordon Plotkin, Glynn Winskel

Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS...

Relationships between models of concurrency (1994)

Mogens Nielsen, Vladimiro Sassone, Glynn Winskel

Models for concurrency can be classified with respect to the three relevant parameters: behaviour/system, interleaving/noninterleaving, linear/branching time. When modelling a process, a choice...

Completeness Results for Linear Logic on Petri Nets (1993)

Uffe Engberg Glynn, Glynn Winskel, Ny Munkegade

Completeness is shown for several versions of Girard's linear logic with respect to Petri nets as the class of models. The strongest logic considered is intuitionistic linear logic, with\Omega ,...

A Classification of Models for Concurrency (Extended Abstract) (1993)

Vladimiro Sassone, Mogens Nielsen, Glynn Winskel

Models for concurrency can be classified with respect to the three relevant parameters: behaviour/system, interleaving/noninterleaving, linear /branching time. When modelling a process, a choice...

Bisimulation and Open Maps (1993)

André Joyal, Mogens Nielsen, Glynn Winskel

An abstract definition of bisimulation is presented. It enables a uniform definition of bisimulation across a range of different models for parallel computation presented as categories. As examples,...

Completeness Results for Linear Logic on Petri Nets (1993)

Uffe Engberg, Glynn Winskel, Ny Munkegade

Completeness is shown for several versions of Girard's linear logic with respect to Petri nets as the class of models. The strongest logic considered is intuitionistic linear logic, with\Omega ,...

Deterministic Behavioural Models for Concurrency (Extended Abstract) (1993)

Vladimiro Sassone, Mogens Nielsen, Glynn Winskel

This paper offers three candidates for a deterministic, noninterleaving, behaviour model which generalizes Hoare traces to the noninterleaving situation. The three models are all proved equivalent in...

Models for Concurrency (A revised version of DAIMI PB-429) (1993)

Glynn Winskel, Mogens Nielsen

This is, we believe, the final version of a chaper for the Handbook of Logic

Completeness Results for Linear Logic on Petri Nets (1993)

Uffe Engberg, Glynn Winskel, Ny Munkegade

Completeness is shown for several versions of Girard’s linear logic with respect to Petri nets as the class of models. The strongest logic considered is intuitionistic linear logic, with ⊗, ⊸,...

Deterministic behavioural models for concurrency (1993)

Vladimiro Sassone, Mogens Nielsen, Glynn Winskel

This paper offers three candidates for a deterministic, noninterleaving, behaviour model which generalizes Hoare traces to the noninterleaving situation. The three models are all proved equivalent in...

Petri Nets as Models of Linear Logic (1990)

Uffe Engberg, Glynn Winskel, Ny Munkegade

The chief purpose of this paper is to appraise the feasibility of Girard's linear logic as a specification language for parallel processes. To this end we propose an interpretation of linear...

Petri Nets as Models of Linear Logic (1990)

Uffe Engberg Glynn, Glynn Winskel, Ny Munkegade

The chief purpose of this paper is to appraise the feasibility of Girard's linear logic as a specification language for parallel processes. To this end we propose an interpretation of linear...

Petri Nets as Models of Linear Logic (1990)

Uffe Engberg Glynn, Glynn Winskel, Ny Munkegade

The chief purpose of this paper is to appraise the feasibility of Girard's linear logic as a specification language for parallel processes. To this end we propose an interpretation of linear...

Petri Nets as Models of Linear Logic (1990)

Uffe Engberg Glynn, Glynn Winskel, Ny Munkegade

The chief purpose of this paper is to appraise the feasibility of Girard's linear logic as a specification language for parallel processes. To this end we propose an interpretation of linear...

Petri Nets as Models of Linear Logic (1990)

Uffe Engberg, Glynn Winskel, Ny Munkegade

The chief purpose of this paper is to appraise the feasibility of Girard's linear logic as a specification language for parallel processes. To this end we propose an interpretation of linear...

Domain Theoretic Models Of Polymorphism (1989)

Thierry Coquand, Inria Rocquencourt, Carl A. Gunter, Glynn Winskel

We give an illustration of a construction useful in producing and describing models of Girard and Reynolds' polymorphic -calculus. The key unifying ideas are that of a Grothendieck fibration and...

Domain Theoretic Models of Polymorphism (1988)

Coquand, Thierry, Gunter, Carl A, Winskel, Glynn

We give an illustration of a construction useful in producing and describing models of Girard and Reynolds' polymorphic λ-calculus. The key unifying ideas are that of a Grothendieck fibration and...

A Representation Result for Free Cocompletions

John Power Gian, A. John Power, Gian Luca Cattani, Glynn Winskel

Given a class F of weights, one can consider the construction that takes a small category C to the free cocompletion of C under weighted colimits, for which the weight lies in F . Provided these free...

Basic Research in Computer Science

Probabilistic Event Structures, Daniele Varacca, Hagen Völzer, Glynn Winskel, Copyright C, Daniele Varacca, ...

This paper studies how to adjoin probability to event structures, leading to the model of probabilistic event structures. In their simplest form probabilistic choice is localised to cells, where...

This document in subdirectoryRS/04/10/ Probabilistic Event Structures and Domains

Daniele Varacca, Hagen Völzer, Glynn Winskel, Copyright C, Daniele Varacca, Hagen Völzer, ...

Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS...

This document in subdirectoryRS/97/36/ Relational Semantics of Non-Deterministic

Non-deterministic Dataflow, Thomas Troels Hildebrandt, Prakash Panangaden, Glynn Winskel, Thomas Hildebr

Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS...

This document in subdirectoryRS/02/48/ Linearity in Process Languages

Mikkel Nygaard, Glynn Winskel, Copyright C, Mikkel Nygaard, Glynn Winskel, Mikkel Nygaard, ...

Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS...

This document in subdirectoryRS/02/49/ HOPLA—A Higher-Order Process Language

Mikkel Nygaard, Glynn Winskel, Copyright C, Mikkel Nygaard, Glynn Winskel, Mikkel Nygaard, ...

Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS...

This document in subdirectoryRS/03/42/ Full Abstraction for HOPLA

Mikkel Nygaard, Glynn Winskel, Copyright C, Mikkel Nygaard, Glynn Winskel, Mikkel Nygaard, ...

Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS...

This document in subdirectoryRS/02/5/ Composing strand spaces

Federico Crazzolara, Glynn Winskel, Copyright C, Federico Crazzolara, Glynn Winskel, Federico Crazzolara, ...

Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS...