Arrow Research search

Author name cluster

Daniel Yankelevich

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

2 papers
2 author rows

Possible papers

2

TCS Journal 1995 Journal Article

Location equivalence in a parametric setting

  • Ugo Montanari
  • Daniel Yankelevich

Location equivalence has been presented in [5] as a bisimulation-based equivalence able to take into account the spatial distribution of processes. In this work, the parametric approach of [12] is applied to location equivalence. An observation domain for localities is identified and the associated equivalence is shown to coincide with the equivalence introducted in [6, 16]. The observation of a computation is a forest (defined up to isomorphism) whose nodes are the events (labeled by observable actions) and where the arcs describe the sublocation relation. We show in the paper that our approach is really parametric. By performing minor changes in the definitions, many equivalences are captured: partial and mixed ordering causal semantics, interleaving, and a variation of location equivalence where the generation ordering is not evidenced. It seems difficult to modify the definitions of [6, 16] to obtain the last observation. The equivalence induced by this observation corresponds to the very intuitive assumption that different locations cannot share a common clock, and hence the ordering between events occurring in different places cannot be determined. Thanks to the general results proved in [12] for the parametric approach, all the observation equivalences described in this paper come equipped with sound and complete axiomatizations.

MFCS Conference 1994 Conference Paper

Read-Write Causality

  • Corrado Priami
  • Daniel Yankelevich

Abstract We introduce a new kind of causality between events of a distributed system that takes the nature of the events into account. More precisely, we distinguish between read (receive) and write (send) operations, yielding a relation called read-write causality. We clarify the intuition of our causality relation through examples, and we compare it with classical models of causality. Also, we show that it is better suited than the classical relations for debugging of formal specifications.

v2026.09.13