Event structures

Winskel, Glynn

doi:10.1007/3-540-17906-2_31

Cited by 369 publications

(443 citation statements)

References 16 publications

Supporting

Mentioning

443

Contrasting

Order By: Relevance

“…One of the most studied noninterleaving models for concurrency is that of event structures [7,12]. Their first class objects are events, assumed to be the atomic computational steps, which are related to each other by cause/effect and conflict relationships.…”

Section: Preliminariesmentioning

confidence: 99%

“…In fact, dropping the axiom of coherence in Definition 2.1 we get semilanguages equivalent to labelled stable event structures [12].…”

Section: Theorem 26mentioning

confidence: 99%

“…It is easy to see that axiom (i) rules out the situation described by just the solid lines in (A)-impossible for stable event structures, while axiom (ii) eliminates cases (B)-which is beyond the descriptive power of general event structures [12] and (C)-impossible for event structures with binary conflict. They narrow down to those orderings of computations arising from prime event structures.…”

Section: Trace Languages and Event Structuresmentioning

confidence: 99%

“…For the behavioural models they are Hoare languages [3] for interleaving, linear-time models, synchronization trees [12] for interleaving, branching-time models, and labelled event structures [13] for noninterleaving, branching-time models. However, for the class of noninterleaving, linear-time models, there does not, at present, seem to be an obvious choice of a corresponding canonical model.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Deterministic behavioural models for concurrency

Sassone

Nielsen

Winskel

1993

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Extended AbstractThis 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 the rather strong sense of being equivalent as categories. The models are: deterministic labelled event structures, generalized trace languages in which the independence relation is context-dependent, and deterministic languages of pomsets.

show abstract

Section: Preliminariesmentioning

confidence: 99%

“…In fact, dropping the axiom of coherence in Definition 2.1 we get semilanguages equivalent to labelled stable event structures [12].…”

Section: Theorem 26mentioning

confidence: 99%

Section: Trace Languages and Event Structuresmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Deterministic behavioural models for concurrency

Sassone

Nielsen

Winskel

1993

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…For example, Nielsen, Plotkin and Winskel, [10], also construct an unfolding of a safe net and we observe in §2 that this does not coincide with the Muller construction. Indeed, we shall point out in §2 that not even a General Event Structure, of the type considered by Winskel in [14], is capable of generating the Muller poset. This leads us to ask whether there is some generalized event structure which is able to capture it.…”

Section: Introductionmentioning

confidence: 99%

A generalized event structure for the Muller unfolding of a safe net

Gunawardena

1993

Concur'93

View full text Add to dashboard Cite

asynchronous circuit, event structure, logics of causality, unfoldingIn 1959, Muller and Bartky published a celebrated paper on .~Theory of Asynchronous Circuits". Among many novel techniques in that paper was the use of lattices resembling the domains of configurations of event structures.In the light of this we present a generalization of Muller's construction to safe nets. We find, however, that this "Muller unfolding" cannot be generated as the domain of configurations of any known event structure, not even a General Event structure. (In particular, this unfolding differs from that of Nielsen, Plotkin and WinskeL) This paper attempts to fill that gap. We make use of the logical approach to causality, developed in previous work, in which a General Event Structure is interpreted as a logical automation arising from a particular logic of causality. We introduce a new causal logic and associate a corresponding logical automaton to any finite safe Petri net. Our main result is that the domain of configurations of this generalized event structure is isomorphic to the Muller unfolding of the net. The work described here was done as part of project STETSON, a joint project between HP Labs and Stanford University on asynchronous hardware design.

show abstract

Normal forms, linearity, and prime algebraicity over nonflat domains

Karádais

2018

Mathematical Logic Qtrly

View full text Add to dashboard Cite

Using representations of nonflat Scott domains to model type systems, it is natural to wish that they be “linear”, in which case the complexity of the fundamental test for entailment of information drops from exponential to linear, the corresponding mathematical theory becomes much simpler, and moreover has ties to models of computation arising in the study of sequentiality, concurrency, and linear logic. Earlier attempts to develop a fully nonflat semantics based on linear domain representations for a rich enough type system allowing inductive types, were designed in a way that felt rather artificial, as it featured certain awkward and counter‐intuitive properties; eventually, the focus turned on general, nonlinear representations. Here we try to turn this situation around, by showing that we can work linearly in a systematic way within the nonlinear model, and that we may even restrict to a fully linear model whose objects are in a bijective correspondence with the ones of the nonlinear and are easily seen to form a prime algebraic domain. To obtain our results we study mappings of finite approximations of objects that can be used to turn approximations into normal and linear forms.

show abstract

Event structures

Cited by 369 publications

References 16 publications

Deterministic behavioural models for concurrency

Deterministic behavioural models for concurrency

A generalized event structure for the Muller unfolding of a safe net

Normal forms, linearity, and prime algebraicity over nonflat domains

Contact Info

Product

Resources

About