A Fine-Grained Modality Classification for Global Predicates

  • Authors:
  • Ajay D. Kshemkalyani

  • Affiliations:
  • -

  • Venue:
  • IEEE Transactions on Parallel and Distributed Systems
  • Year:
  • 2003

Quantified Score

Hi-index 0.01

Visualization

Abstract

Specifying and detecting predicates in a distributed execution is an important problem. Distributed execution observation has classically used two modalities驴\big. Possibly(\phi)\bigr. and \big. Definitely(\phi)\bigr.驴for predicate \big. \phi\bigr.. Based on the temporal interactions of intervals, the author identified a complete, orthogonal set of relationships \big. \Re\bigr. between pairs of intervals in a distributed execution. This paper shows how to map the rich, orthogonal classification of modalities of pairwise interval interactions, to the classical coarse-grained classification, \big. Possibly(\phi)\bigr. and \big. Definitely(\phi)\bigr., for specifying predicates defined on any number of processes. This increases the power of expressing the temporal modalities under which predicates can be specified, beyond the current \big. Possibly\bigr./\big. Definitely\bigr. classification. This paper also gives timestamp-based tests for the orthogonal modalities in the refined classification.