Results 31 to 40 of about 5,530,700 (284)
On Thin Air Reads: Towards an Event Structures Model of Relaxed Memory [PDF]
Logical Methods in Computer Science, 2019 To model relaxed memory, we propose confusion-free event structures over an alphabet with a justification relation. Executions are modeled by justified configurations, where every read event has a justifying write event. Justification alone is too weak a
Alan Jeffrey, James Riely
doaj +1 more source
Formal modelling for Ada implementations: tasking Event-B [PDF]
, 2012 This paper describes a formal modelling approach, where Ada code is automatically generated from the modelling artefacts. We introduce an implementation-level specification, Tasking Event-B, which is an extension to Event-B.
Edmunds, Andrew +2 more
core +2 more sources
PASBio: predicate-argument structures for event extraction in molecular biology
BMC Bioinformatics, 2004 Background The exploitation of information extraction (IE), a technology aiming to provide instances of structured representations from free-form text, has been rapidly growing within the molecular biology (MB) research community to keep track of the ...
Shah Parantu K +2 more
doaj +1 more source
Mantichora, 2020 By asking partakers to ingest, relish, internalize, and personalize the event, engaging partakers as co-creators of the event, focusing on affect, and creating dramaturgical structures that allow partakers to savor and digest, site-based digital ...
Erin B. Mee
doaj +1 more source
Comparing neural models for nested and overlapping biomedical event detection
BMC Bioinformatics, 2022 Background Nested and overlapping events are particularly frequent and informative structures in biomedical event extraction. However, state-of-the-art neural models either neglect those structures during learning or use syntactic features and external ...
Kurt Espinosa +5 more
doaj +1 more source
Generalised verification of the observer property in discrete event systems [PDF]
, 2012 The observer property is an important condition to be satisfied by abstractions of Discrete Event Systems (DES) models. This paper presents a generalised version of a previous algorithm which tests if an abstraction of a DES obtained through natural ...
Pena, Patricia N. +4 more
core +1 more source
Heidelberger Jahrbücher Online, 2020 A single event is not sufficient, to identify a structure. Only the repetition of similar events can lead to an understanding of the underlying structure.
Hans J. Pirner
doaj +1 more source
Probabilistic Event Structures and Domains
BRICS Report Series, 2004 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.
Daniele Varacca +2 more
openaire +6 more sources
Language and tool support for event refinement structures in Event-B
, 2015 Event-B is a formal method for modelling and verifying the consistency of chains of model refinements. The event refinement structure (ERS) approach augments Event-B with a graphical notation which is capable of explicit representation of control flows ...
Salehi Fathabadi, Asieh +2 more
core +1 more source
Conflict-preserving abstraction of discrete event systems using annotated automata [PDF]
, 2012 This paper proposes to enhance compositional verification of the nonblocking property of discrete event systems by introducing annotated automata. Annotations store nondeterministic branching information, which would otherwise be stored in extra states ...
Malik, Robi, Ware, Simon
core +1 more source