### BibTeX

@MISC{Winskel_relationsin,

author = {Glynn Winskel},

title = {Relations in Concurrency },

year = {}

}

### Years of Citing Articles

### OpenURL

### Abstract

The theme of this paper is profunctors, and their centrality and ubiquity in understanding concurrent computation. Profunctors (a.k.a. distributors, or bimodules) are a generalisation of relations to categories. Here they are first presented and motivated via spans of event structures, and the semantics of nondeterministic dataflow. Profunctors are shown to play a key role in relating models for concurrency and to support an interpretation as higher-order processes (where input and output may be processes). Two recent directions of research are described. One is concerned with a language and computational interpretation for profunctors. This addresses the duality between input and output in profunctors. The other is to investigate general spans of event structures (the spans can be viewed as special profunctors) to give causal semantics to higher-order processes. For this it is useful to generalise event structures to allow events which “persist.”

### Citations

3720 | A theory of communicating sequential processes - Brookes, Hoare, et al. - 1984 |

3497 |
Communication and Concurrency
- Milner
- 1989
(Show Context)
Citation Context ...s, and to the formal understanding of their semantics. As a result, in addition to standard models like languages, automata and transition systems [4, 9], models like Petri nets [8], process algebras =-=[6, 2]-=-, Hoare traces [3], Mazurkiewicz traces [5], synchronization trees [15] and event structures [7, 16] have been introduced. The idea common to the models above is that they are based on atomic units of... |

2535 | Time, clocks, and the ordering of events in a distributed system - Lamport - 1978 |

1635 | The temporal logic of reactive and concurrent systems - Manna, Pnueli - 1992 |

1450 | A Calculus of Communicating Systems - Milner - 1982 |

1401 | A structural approach to operational semantics
- Plotkin
- 2004
(Show Context)
Citation Context ...itable models for concurrent and distributed processes, and to the formal understanding of their semantics. As a result, in addition to standard models like languages, automata and transition systems =-=[4, 9]-=-, models like Petri nets [8], process algebras [6, 2], Hoare traces [3], Mazurkiewicz traces [5], synchronization trees [15] and event structures [7, 16] have been introduced. The idea common to the m... |

1028 | Categories for the working mathematician - Lane - 1998 |

901 | The Semantics of Simple Language for Parallel Programming - Kahn - 1974 |

437 | Bisimulation through probabilistic testing - Larsen, Skou - 1991 |

422 | Category Theory for Computing Science - Barr, Wells - 1990 |

421 |
Algebraic Theory of Processes
- Hennessy
- 1988
(Show Context)
Citation Context ...s, and to the formal understanding of their semantics. As a result, in addition to standard models like languages, automata and transition systems [4, 9], models like Petri nets [8], process algebras =-=[6, 2]-=-, Hoare traces [3], Mazurkiewicz traces [5], synchronization trees [15] and event structures [7, 16] have been introduced. The idea common to the models above is that they are based on atomic units of... |

410 |
Kommunikation mit Automaten
- Petri
- 1962
(Show Context)
Citation Context ...d distributed processes, and to the formal understanding of their semantics. As a result, in addition to standard models like languages, automata and transition systems [4, 9], models like Petri nets =-=[8]-=-, process algebras [6, 2], Hoare traces [3], Mazurkiewicz traces [5], synchronization trees [15] and event structures [7, 16] have been introduced. The idea common to the models above is that they are... |

335 | Calculi for synchrony and asynchrony - Milner - 1983 |

321 | The linear time-branching time spectrum - Glabbeek - 1990 |

282 | Domains for denotational semantics - Scott - 1982 |

269 |
Event structures
- Winskel
- 1986
(Show Context)
Citation Context ...like languages, automata and transition systems [4, 9], models like Petri nets [8], process algebras [6, 2], Hoare traces [3], Mazurkiewicz traces [5], synchronization trees [15] and event structures =-=[7, 16]-=- have been introduced. The idea common to the models above is that they are based on atomic units of change—be they called transitions, actions, events or symbols from an alphabet—which are indivisibl... |

248 | The Formal Semantics of Programming Languages: An Introduction - Winskel - 1993 |

242 | Modeling Concurrency with Partial Orders - Pratt - 1986 |

220 | Games and full completeness for multiplicative linear logic - Abramsky, Jagadeesan - 1994 |

202 | Sheaves in Geometry and Logic. A First Introduction to Topos Theory - Lane, Moerdijk - 1992 |

179 | Petri nets, event structures, and domains - Nielsen, Plotkin, et al. - 1981 |

175 |
Formal verification of parallel programs
- Keller
- 1976
(Show Context)
Citation Context ...itable models for concurrent and distributed processes, and to the formal understanding of their semantics. As a result, in addition to standard models like languages, automata and transition systems =-=[4, 9]-=-, models like Petri nets [8], process algebras [6, 2], Hoare traces [3], Mazurkiewicz traces [5], synchronization trees [15] and event structures [7, 16] have been introduced. The idea common to the m... |

151 | An overview and synthesis on timed process algebras - Nicollin, Sifakis - 1991 |

133 | Modelling concurrency with geometry - Pratt - 1991 |

130 | Concurrent program schemes and their interpretation - Mazurkiewicz - 1977 |

125 | Bisimulation from open maps - Joyal, Nielsen, et al. - 1996 |

111 | Scenarios, a model of non determinate computation - Brock, Ackerman - 1981 |

96 | Categories of Asynchronous Systems - Bednarczyk - 1988 |

90 |
Basic Notions of Trace Theory, in
- Mazurkiewicz
- 1988
(Show Context)
Citation Context ...mantics. As a result, in addition to standard models like languages, automata and transition systems [4, 9], models like Petri nets [8], process algebras [6, 2], Hoare traces [3], Mazurkiewicz traces =-=[5]-=-, synchronization trees [15] and event structures [7, 16] have been introduced. The idea common to the models above is that they are based on atomic units of change—be they called transitions, actions... |

86 | Foncteurs analytiques et espèces de structures - Joyal - 1987 |

81 | Event structure semantics for CCS and related languages
- Winskel
- 1982
(Show Context)
Citation Context ...is deterministic if for any c ∈ L(ES ), and for any pair of events e, e′ ∈ EES , whenever c ⊢ e, c ⊢ e ′ and ℓ(e) = ℓ(e′), then e = e′. This defines the category dLES as a full subcategory of LES. In =-=[14]-=-, it is shown that synchronization trees and labelled event structures are related by a coreflection from ST to LES. The left adjoint associates with an ST-object S, a LES-object where the events are ... |

79 | Categorical Combinators, Sequential Algorithms and Functional Programming - Curien - 1986 |

74 |
G.: Petri nets, event structures and domains, part I. Theoretical Computer Science 13
- Nielsen, Plotkin, et al.
- 1981
(Show Context)
Citation Context ...like languages, automata and transition systems [4, 9], models like Petri nets [8], process algebras [6, 2], Hoare traces [3], Mazurkiewicz traces [5], synchronization trees [15] and event structures =-=[7, 16]-=- have been introduced. The idea common to the models above is that they are based on atomic units of change—be they called transitions, actions, events or symbols from an alphabet—which are indivisibl... |

73 | Petri nets, algebras, morphisms, and compositionality - Winskel - 1987 |

62 | Events in computation - Winskel - 1980 |

60 | A non-interleaving semantics for CCS based on proved transitions, Fundamenta Informaticae XI - BOUDOL, CASTELLANI - 1988 |

60 | Comparative Concurrency Semantics and Refinement of Actions - Glabbeek - 1990 |

52 |
Concurrent Machines
- Shields
- 1985
(Show Context)
Citation Context ...een as adding “concurrency” to ST. Moreover, such enriched transition systems should also represent the “system model” version of event structures. Several such models have appeared in the literature =-=[12, 1, 13]-=-. Here we choose a variation of these. Definition 2.4 (Transition Systems with Independence) A transition system with independence is a structure (S, sI , L,Tran, I) consisting of a transition system ... |

48 | On Partial Languages - Grabowski - 1981 |

44 | Categorical type theory - Jacobs - 1991 |

43 | Fair games and full completeness for multiplicative linear logic without the mix-rule. Unpublished - Hyland, Ong - 1992 |

41 | Fibred categories and the foundations of näıve category theory - Bénabou - 1985 |

41 | Concurrent Transition Systems
- Stark
- 1989
(Show Context)
Citation Context ...een as adding “concurrency” to ST. Moreover, such enriched transition systems should also represent the “system model” version of event structures. Several such models have appeared in the literature =-=[12, 1, 13]-=-. Here we choose a variation of these. Definition 2.4 (Transition Systems with Independence) A transition system with independence is a structure (S, sI , L,Tran, I) consisting of a transition system ... |

41 | Modèles complètement adéquats et stables des lambda-calculus typés. Thèse d’Etat, Université Paris VII - BERRY - 1979 |

37 | Bisimulation and open maps - Joyal, Nielsen, et al. - 1993 |

35 | Bisimulation and action refinement - Vogler - 1993 |

35 | Partial-order methods for temporal verification - Wolper, Godefroid - 1993 |

33 | Flow models of distributed computations: three equivalent semantics for CCS - BOUDOL, CASTELLANI - 1994 |

33 | Categories for the Working - MacLane |

32 | A temporal logic for reasoning about partially ordered computations - Pinter, Wolper - 1984 |