scholarly journals An event structure semantics for P/T contextual nets: Asymmetric event structures

1998 ◽  
pp. 63-80 ◽  
Author(s):  
Paolo Baldan ◽  
Andrea Corradini ◽  
Ugo Montanari
Keyword(s):  
Event Structure ◽  
Event Structures

On the Event Structural Properties of the English Get-Passive

2020 ◽  
pp. 1-74
Author(s):  
Alison Biggs ◽  
David Embick
Keyword(s):  
Division Of Labor ◽  
Structural Properties ◽  
Argument Structure ◽  
Event Structure ◽  
Test Case ◽  
Event Structures ◽  
Structural Differences ◽  
Responsible Party

An important ongoing discussion in theories of argument structure concerns the explanatory division of labor between thematic properties and event structure. In this context, the English get-passive provides an interesting test case. Much previous work has analyzed get-passives as differing thematically from be-passives. Yet many get-passive properties remain poorly understood. We present an analysis of the get-passive centered on the proposal that it contains additional event structure (realized as get) relative to its be counterpart. We employ by-adjuncts to identify the event structures in passive types, and demonstrate that the behavior of this and other diagnostics support the conclusion that get- and be-passives differ systematically in ways that accord with our analysis. Further discussion considers the prominent proposal from previous studies that get-passives differ thematically from be-passives in (sometimes) assigning an Agent role to their surface subjects. We show that there is no evidence for such an analysis. Instead, intuitions about the interpretation of the get-passive surface subject arise from how an event’s Responsible Party is identified: contrasts between get and be on this dimension are a consequence of event structural differences between the two. The overall result is a unified analysis of the get-passive, one that has implications for the role of event structure in understanding the syntax and interpretation of arguments.

scholarly journals A Cartesian closed category of event structures with quotients

2006 ◽  
Vol Vol. 8 ◽  
Author(s):  
Samy Abbes
Keyword(s):  
Topological Space ◽  
Event Structure ◽  
Cartesian Closed Category ◽  
New Class ◽  
Closed Category ◽  
Event Structures ◽  
Natural Notion ◽  
International Audience ◽  
Cartesian Closed

International audience We introduce a new class of morphisms for event structures. The category obtained is cartesian closed, and a natural notion of quotient event structure is defined within it. We study in particular the topological space of maximal configurations of quotient event structures. We introduce the compression of event structures as an example of quotient: the compression of an event structure E is a minimal event structure with the same space of maximal configurations as E.

scholarly journals Adverbial Quantification and Event Structures

1991 ◽  
Vol 17 (1) ◽  
pp. 439 ◽  
Author(s):  
Barbara H. Partee
Keyword(s):  
Annual Meeting ◽  
Event Structure ◽  
General Session ◽  
Event Structures

Proceedings of the Seventeenth Annual Meeting of the Berkeley Linguistics Society: General Session and Parasession on The Grammar of Event Structure (1991), pp. 439-456

scholarly journals Probabilistic Event Structures and Domains

2004 ◽  
Vol 11 (10) ◽  
Author(s):  
Daniele Varacca ◽  
Hagen Völzer ◽  
Glynn Winskel
Keyword(s):  
Representation Theorem ◽  
Event Structure ◽  
Domain Theory ◽  
Probabilistic Choice ◽  
Event Structures ◽  
Causal Independence ◽  
Probabilistic Processes

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 conflict arises; in which case probabilistic independence coincides with causal independence. An application to the semantics of a probabilistic CCS is sketched. An event structure is associated with a domain--that of its configurations ordered by inclusion. In domain theory probabilistic processes are denoted by continuous valuations on a domain. A key result of this paper is a representation theorem showing how continuous valuations on the domain of a confusion-free event structure correspond to the probabilistic event structures it supports. We explore how to extend probability to event structures which are not confusion-free via two notions of probabilistic runs of a general event structure. Finally, we show how probabilistic correlation and probabilistic event structures with confusion can arise from event structures which are originally confusion-free by using morphisms to rename and hide events.

scholarly journals A projective formalism applied to topological and probabilistic event structures

2007 ◽  
Vol 17 (4) ◽  
pp. 819-837 ◽  
Author(s):  
SAMY ABBES
Keyword(s):  
Probability Measure ◽  
Event Structure ◽  
Maximal Elements ◽  
Extension Theorems ◽  
Measure Extension ◽  
Event Structures

This paper introduces projective systems for topological and probabilistic event structures. The projective formalism is used for studying the domain of configurations of a prime event structure and its space of maximal elements. This is done from both a topological and a probabilistic viewpoint. We give probability measure extension theorems in this framework.

Selecting roots: the view from compounding

2019 ◽  
Vol 36 (3) ◽  
pp. 389-410
Author(s):  
Dimitris Michelioudakis ◽  
Nikos Angelopoulos
Keyword(s):  
Event Structure ◽  
Event Structures ◽  
Theta Role ◽  
Indirect Argument

Abstract We investigate how saturation of different theta-roles by the non-head constituent correlates with derivational suffixes and, in turn, with the event structures compatible with those suffixes. We also investigate XP realisations of themes, causers and instruments in deverbal nominal and participial constructions and which ±agentive and/or ±process/episodic sub-readings allow which type of argument. It turns out that for each theta-role, the contexts that allow an XP realisation are exactly the complement of the contexts that would allow compounding of that same theta-role. We take this complementarity to be an indirect argument in favour of (i) divorcing argument licensing from argument selection and (ii) dissociating argument introduction from event-structure-related heads, which then potentially reaffirms the role of roots in (first phase) syntax.

Event Structure Representation of the Behaviour of Place/Transition Systems

1988 ◽  
Vol 11 (4) ◽  
pp. 405-432
Author(s):  
Józef Winkowski
Keyword(s):  
Petri Nets ◽  
Event Structure ◽  
Transition Systems ◽  
Structure Representation ◽  
Global Behaviour ◽  
Event Structures ◽  
Mathematical Systems

It is shown how the nonsequential behaviour of marked Petri nets of places and transitions can be described with the aid of mathematical systems related to labelled event structures. The method of description is modular in the sense that the global behaviour is obtained by combining local ones corresponding lo places and transitions.

scholarly journals On the Integration of Dative Adjuncts into Event Structures in Yapa Languages

Languages ◽  
2021 ◽  
Vol 6 (3) ◽  
pp. 136
Author(s):  
Mitchell Browne
Keyword(s):  
Argument Structure ◽  
Event Structure ◽  
Complex Predicates ◽  
Complex Predicate ◽  
Grammatical Relations ◽  
Event Structures ◽  
Single Argument ◽  
Grammatical Relation ◽  
New Research

Warlpiri and Warlmanpa (Ngumpin-Yapa languages of Australia) exhibit a complex predicate construction in which a class of preverbs introduces a single argument that is not shared by the argument structure of the inflecting verb, nor is there necessarily any shared event structure. This is problematic for many theories of linking structures of complex predicates, since no arguments or events are shared between the predicative elements of the complex predicate. The same grammatical relation is instantiated by a beneficiary adjunct. In light of new research in event and argument structure, I propose a lexical rule which introduces an applicative argument to account for the beneficiary construction; and that the preverbs take another predicate as one of their arguments to account for the complex predicates. The applicative rule and the preverbs both introduce an argument of the same grammatical relation, leading to interesting interactions, given that two grammatical relations of the same type are not expected to co-occur within a single clause.

scholarly journals Regular Trace Event Structures

1996 ◽  
Vol 3 (32) ◽  
Author(s):  
P. S. Thiagarajan
Keyword(s):  
Petri Nets ◽  
Event Structure ◽  
Branching Time ◽  
Temporal Logics ◽  
Event Structures ◽  
Starting Point

We propose trace event structures as a starting point for constructing effective branching time temporal logics in a non-interleaved setting. As a first step towards achieving this goal, we define the notion of a regular trace event structure. We then provide some simple characterizations of this notion of regularity both in terms of recognizable trace languages and in terms of finite 1-safe Petri nets.

The true concurrency of differential interaction nets

2016 ◽  
Vol 28 (7) ◽  
pp. 1097-1125 ◽  
Author(s):  
DAMIANO MAZZA
Keyword(s):  
Event Structure ◽  
Point Of View ◽  
Parallel Composition ◽  
Process Calculus ◽  
True Concurrency ◽  
Differential Interaction ◽  
Event Structures

We analyse the reduction of differential interaction nets from the point of view of so-called ‘true concurrency,’ that is, employing a non-interleaving model of parallelism. More precisely, we associate with each differential interaction net an event structure describing its reduction. We show how differential interaction nets are only able to generate confusion-free event structures, and we argue that this is a serious limitation in terms of the concurrent behaviours they may express. In fact, confusion is an extremely elementary phenomenon in concurrency (for example, it already appears in CCS with just prefixing and parallel composition) and we show how its presence is preserved by any encoding respecting the degree of distribution and the reduction semantics. We thus infer that no reasonably expressive process calculus may be satisfactorily encoded in differential interaction nets. We conclude with an analysis of one such encoding proposed by Ehrhard and Laurent, and argue that it does not contradict our claims, but rather supports them.

Sign in / Sign up

Export Citation Format

Share Document