Using Consistent Subcuts for Detecting Stable Properties

Abstract

We present a general algorithm for detecting whether a property holds in a distributed system, where the property is a member of a class we call the locally stable properties. Our algorithm is based on a decentralized method of constructing a maximal subset of the local states that are mutually consistent, which in turn is based on a weakened version of vector time stamps. We demonstrate the utility of our algorithm by using it to derive some specialized property-detection protocols, including two previously-known protocols that are known to be efficient.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1991
Accession Number
ADA237122

Entities

People

  • Keith Marzullo
  • Laura Sabel

Organizations

  • Cornell University

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Asynchronous Systems
  • Classification
  • Computations
  • Computer Science
  • Computers
  • Department Of Defense
  • Detection
  • Distributed Computing
  • Equations
  • New York
  • Security
  • Sequences
  • Universities

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Agent-Based Social Robotics and Mobile-Assisted Learning in Virtual Environments.
  • Mathematical Modeling and Probability Theory.