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.
Type de document :
Rapport
[Research Report] RR-1961, INRIA. 1993
Liste complète des métadonnées

https://hal.inria.fr/inria-00074712
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 16:07:19
Dernière modification le : mercredi 16 mai 2018 - 11:23:02
Document(s) archivé(s) le : mardi 12 avril 2011 - 18:23:21

Fichiers

Identifiants

  • 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〉

Partager

Métriques

Consultations de la notice

156

Téléchargements de fichiers

52