Generating non-conspiratorial executions

Authors:
D. Ruiz;R. Corchuelo;J. L. Arjona
Affiliations:
Dep. de Lenguajes y Sistemas Informáticos, Universidad de Sevilla, ETSI Informática, Avda. Reina Mercedes, s/n, Sevilla 41012, Spain;Dep. de Lenguajes y Sistemas Informáticos, Universidad de Sevilla, ETSI Informática, Avda. Reina Mercedes, s/n, Sevilla 41012, Spain;Dep. de Tecnologías de la Información, Universidad de Huelva, Pabellón Torreumbría, Ctra. Huelva-La Rábida, Huelva 21071, Spain
Venue:
Information Processing Letters
Year:
2007

Citing 13
Cited 0

Fairness and conspiracies

Information Processing Letters
Fairness in parallel programs: the transformational approach

ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed cooperation with action systems

ACM Transactions on Programming Languages and Systems (TOPLAS)
Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability

Theoretical Computer Science
Refinement of actions and equivalence notions for concurrent systems

Acta Informatica
On fairness notions in distributed systems I.4: a characterization of implementability

Information and Computation
On fairness notions in distributed systems II.: equivalence-completions and their hierarchies

Information and Computation
An Algorithm for Ensuring Fairness and Liveness in Non-deterministic Systems Based on Multiparty Interactions

Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Refinement-Robust Fairness

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Action systems in incremental and aspect-oriented modeling

Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Fairness and hyperfairness

Distributed Computing
Fairness and hyperfairness in multi-party interactions

Distributed Computing
On conspiracies and hyperfairness in distributed computing

DISC'05 Proceedings of the 19th international conference on Distributed Computing

Quantified Score

Hi-index	0.89

Visualization

Abstract

Avoiding conspiratorial executions is useful for debugging, model checking or refinement, and helps implement several well-known problems in faulty environments; furthermore, avoiding non-equivalence robust executions prevents conflicting observations in a distributed setting from occurring. Our results prove that scheduling pairs of states and transitions in a strongly fair manner suffices to prevent conspiratorial executions; we then establish a formal connection between conspiracies and equivalence robustness; finally, we present a transformation scheme to implement our results and show how to build them into a well-known distributed scheduler. Previous results were applicable to a subset of systems only, just attempted to characterise potential conspiracies, or were tightly bound up with a particular interaction model.