Topics
causalityOrganisation
Abstract: The paper shows that characterizing the causal relationship between significant events is an important but non-trivial aspect for understanding the behavior of distributed programs. An introduction to the notion of causality and its relation to logical time is given; some fundamental results concerning the characterization of causality are presented. Recent work on the detection of causal relationships in distributed computations is surveyed. The relative merits and limitations of the different approaches are discussed, and their general feasibility is analyzed
. We study causality in the ß-calculus. Our notion of causality combines the dependencies given by t...
At some abstraction level a distributed computation can be modeled as a partial order on a set of ob...
This paper presents a framework for distributed simulation that is based on system-theoretic and log...
The paper shows that characterizing the causal relationship between significant events is an importa...
An important problem in analyzing distributed computations is the amount of information. In event-ba...
Abstract An important problem in analyzing distributed computations is the amount of information. In...
In a distributed system, it is often important to detect the causal relationships between events, wh...
We illustrate a technique for proving properties of distributed programs. Our tech-nique avoids the ...
The concept of causality between events is fundamental to the design and analysis of parallel and di...
For digital interactive distributed systems the timing of their events and the causality between the...
Memory space and processor time are basic resources when executing a program. But beside this implem...
The outcome of any computation is determined by the order of the events in the computation and the s...
The analysis of causal relations among events in a distributed computation plays a central role in d...
Tracking causality should not be ignored. It is important in the design of many distributed algorith...
Concurrent systems identify systems, either software, hardware or even biological systems, that are ...
. We study causality in the ß-calculus. Our notion of causality combines the dependencies given by t...
At some abstraction level a distributed computation can be modeled as a partial order on a set of ob...
This paper presents a framework for distributed simulation that is based on system-theoretic and log...
The paper shows that characterizing the causal relationship between significant events is an importa...
An important problem in analyzing distributed computations is the amount of information. In event-ba...
Abstract An important problem in analyzing distributed computations is the amount of information. In...
In a distributed system, it is often important to detect the causal relationships between events, wh...
We illustrate a technique for proving properties of distributed programs. Our tech-nique avoids the ...
The concept of causality between events is fundamental to the design and analysis of parallel and di...
For digital interactive distributed systems the timing of their events and the causality between the...
Memory space and processor time are basic resources when executing a program. But beside this implem...
The outcome of any computation is determined by the order of the events in the computation and the s...
The analysis of causal relations among events in a distributed computation plays a central role in d...
Tracking causality should not be ignored. It is important in the design of many distributed algorith...
Concurrent systems identify systems, either software, hardware or even biological systems, that are ...
. We study causality in the ß-calculus. Our notion of causality combines the dependencies given by t...
At some abstraction level a distributed computation can be modeled as a partial order on a set of ob...
This paper presents a framework for distributed simulation that is based on system-theoretic and log...
Add to ORKG