Skip to Main content Skip to Navigation
Reports

Sequence-based global predicates for distributed computations : definitions and detection algorithms

Ozalp Babaoglu 1 Michel Raynal 2
2 ADP - Distributed Algorithms and Protocols
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : We consider the problem of detecting sequences of predicates defined over global states of distributed computation. We introduce two new global predicate classes called simple sequences and interval-constrained sequences that define causally-ordered sets of desirable states along with intervening forbidden states. Our formalism is more general than former proposals and permits concise and intuitive expression of many interesting system properties. Algorithms are given for verifying formulas belonging to these predicate classes in an on-line and observer-independent manner during distributed computations. We illustrate the utility of our results by applying them to examples drawn from programs testing, debugging and dynamic reconfiguration in distributed systems.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00074712
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 4:07:19 PM
Last modification on : Friday, February 12, 2021 - 3:33:14 AM
Long-term archiving on: : Tuesday, April 12, 2011 - 6:23:21 PM

Identifiers

  • HAL Id : inria-00074712, version 1

Citation

Ozalp Babaoglu, Michel Raynal. Sequence-based global predicates for distributed computations : definitions and detection algorithms. [Research Report] RR-1961, INRIA. 1993. ⟨inria-00074712⟩

Share

Metrics

Record views

191

Files downloads

85