Events, Causality and Symmetry

Winskel, Glynn

doi:10.1093/comjnl/bxp052

Cited by 24 publications

(9 citation statements)

References 89 publications

(127 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…General approaches to the denotational or operational semantics of effects [36,34] provide an intriguing starting point for the study of provenance in the presence of effects. Ideas from concurrency theory, particularly Winskel's event structures [58], may be a good place to start in understanding the meaning of provenance in concurrent or distributed settings.…”

Section: Related Workmentioning

confidence: 99%

Toward a Theory of Self-explaining Computation

Cheney

Acar

Perera

2013

In Search of Elegance in the Theory and Practice of Computation

View full text Add to dashboard Cite

Abstract. Provenance techniques aim to increase the reliability of human judgments about data by making its origin and derivation process explicit. Originally motivated by the needs of scientific databases and scientific computation, provenance has also become a major issue for business and government data on the Web. However, so far provenance has been studied only in relatively restrictive settings: typically, for data stored in databases or scientific workflow systems, and processed by query or workflow languages of limited expressiveness. Long-term provenance solutions require an understanding of provenance in other settings, particularly the general-purpose programming or scripting languages that are used to glue different components such as databases, Web services and workflows together. Moreover, what is required is not only an account of mechanisms for recording provenance, but also a theory of what it means for provenance information to explain or justify a computation. In this paper, we begin to outline a such a theory of self-explaining computation. We introduce a model of provenance for a simple imperative language based on operational derivations and explore its properties.

show abstract

Section: Related Workmentioning

confidence: 99%

Toward a Theory of Self-explaining Computation

Cheney

Acar

Perera

2013

In Search of Elegance in the Theory and Practice of Computation

View full text Add to dashboard Cite

show abstract

“…The (in-)dependency relations are inspired by Mazurkiewicz trace equivalences [4], which capture both aspects. The conflict relation is inspired by the theory of event structures [11]. The enable relation is inspired by dynamic partial order reduction [7].…”

Section: Related Workmentioning

confidence: 99%

Characterization of Failure Effects on AADL Models

Ern¹,

Nguyen

Noll

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Prior works on model-based Failure Modes and Effects Analysis (FMEA) automatically generate a FMEA table given the system model, a set of failure modes, and a set of possible effects. The last requirement is critical as bias may occur: since the considered failure effects are restricted to the anticipated ones, unexpected effects -the most interesting ones -are disregarded in the FMEA.In this paper, we propose and investigate formal concepts that aim to overcome this bias. They support the construction of FMEA tables solely based on the system model and the failure modes, i.e., without requiring the set of effects as input. More concretely, given a system specification in the Architecture Analysis and Design Language (AADL), we show how to derive relations that characterize the effects of failures based on the state transition system of that specification. We also demonstrate the benefits and limitations of these concepts on a satellite case study.

show abstract

“…Structures with a contact or a proximity relation are studied in topology, in region based theory of space and, possibly with different terminology, in algebraic logic and computer science [1,2,3,4,5,6,7,8,10,11,12,13,14,15,16]. As a basic example, if X is a topological space with closure K, the binary relation δ defined by x δ y if Kx ∩ Ky = ∅, for x, y ⊆ X is a proximity, called the standard proximity [3,Example 2.1.3].…”

Section: Introductionmentioning

confidence: 99%

Universal specialization semilattices

Lipparini

2022

Quaestiones Mathematicae

View full text Add to dashboard Cite

We devise exact conditions under which a contact semilattice can be semilattice embedded into a Boolean algebra with an overlap contact relation, equivalently, into a distributive lattice with additive contact relation.Contact algebras are Boolean algebras endowed with a further contact binary relation. Contact algebras play an important role in region-based theory of space [1]. They might be seen as a point-free algebraization of proximities, a useful generalization of the notion of topology [2,7]. See the quoted sources for more references and details.Ivanova [4] provides arguments suggesting the naturalness of contact joinsemilattices. In a nutshell, if a is a region of space, its complement is possibly not well-defined, since it is dependent on the universe in which we consider a. Moreover, if one considers large but limited regions of space, both complementation and meet might turn out to be inappropriate.Parallel arguments in favor of the use of the join operation only-without meet or complementation-are presented in [5]. The arguments are motivated by the fact that if f → is the image function from P(X) to P(Y ) associated to some function f : X → Y , then f → preserves unions but not necessarily intersections or complements.At a very elementary level, the use of the join operation alone is also suggested by the fact that it is the only operation appearing in the axioms for a contact relation; see Definition 1 below. As another advantage, generally, representation theorems for semilattices do not need the axiom of choice.A standard definition of contact in a semilattice guarantees that the semilattice can be (semilattice-) embedded into a complete lattice, which can be chosen to have trivial contact [6]. On the other hand, the standard definition is too weak to guarantee that a contact semilattice can be (semilattice-) embedded into a distributive lattice. Here we find necessary and sufficient conditions under which the above embeddability can be obtained. In this way we get an equivalent axiomatization for contact join-semilattices in the sense of [4].Definition 1. In the present note semilattices shall always be intended in the sense of join semilattices with a minimum element 0. The existence of 0 is assumed only in order to simplify some statements; see Remark 6 in [6].

show abstract

Events, Causality and Symmetry

Cited by 24 publications

References 89 publications

Toward a Theory of Self-explaining Computation

Toward a Theory of Self-explaining Computation

Characterization of Failure Effects on AADL Models

Universal specialization semilattices

Contact Info

Product

Resources

About