Arrow Research search
Back to MFCS

MFCS 1996

Causal Testing

Conference Paper Contributed Papers Algorithms and Complexity · Theoretical Computer Science

Abstract

Abstract We suggest an equivalence notion for event structures as a semantic model of concurrent systems. It combines the notion of testing (or failure) equivalence with respect to the timing of choices between different executions with a precise account of causalities between action occurrences as in causal semantics. This fills an open gap in the lattice of equivalences considered in comparative concurrency semantics. We show that our notion coincides with a “canonical” equivalence obtained as the usual testing performed on causal trees. Furthermore, we show that it is invariant under action refinement, thus fulfilling a standard criterion for non-interleaving equivalences.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
International Symposium on Mathematical Foundations of Computer Science
Archive span
1973-2025
Indexed papers
3045
Paper id
999336774897724016
v2026.09.13