Equivalence of Structural Knowledges in Distributed Algorithms
نویسندگان
چکیده
Distributed algorithms correctness usually relies upon the use of some knowledge about the underlying network (a specific topology, some metrics,...). We define equivalent structural knowledges to be such knowledges that can be computed distributively one knowing the other. We present a combinatorial characterization of this equivalence. Some applications are also given: zero knowledge, classical metrics (size, diameter,...). This characterization is defined in terms of graphs coverings and quasicoverings. The proofs are based upon an algorithm proposed by A. Mazurkiewicz, and on techniques of termination detection by Shy, Szymanski, and Prywes.
منابع مشابه
Partial Observation in Distributed Supervisory Control of Discrete-Event Systems
Distributed supervisory control is a method to synthesize local controllers in discrete-eventsystems with a systematic observation of the plant. Some works were reported on extending this methodby which local controllers are constructed so that observation properties are preserved from monolithic todistributed supervisory control, in an up-down approach. In this paper, we find circumstances in ...
متن کاملConformance of Distributed Systems
This paper introduces a new conformance relation between a specification and an implementation of a distributed system. It is based on a local view which allows to avoid or reduce the state explosion problem. The conformance relation is defined via Petri nets and shows not only equivalence between transitions but also equivalence between local states. This equivalence depends on the structural ...
متن کاملRelational Equivalence Proofs Between Imperative and MapReduce Algorithms
MapReduce frameworks are widely used for the implementation of distributed algorithms. However, translating imperative algorithms into these frameworks requires significant structural changes to the algorithm. As the costs of running faulty algorithms at scale can be severe, it is highly desirable to verify the correctness of the translation, i.e., to prove that the MapReduce version is equival...
متن کاملIntegrating Locally Learned Causal Structures with Overlapping Variables
In many domains, data are distributed among datasets that share only some variables; other recorded variables may occur in only one dataset. While there are asymptotically correct, informative algorithms for discovering causal relationships from a single dataset, even with missing values and hidden variables, there have been no such reliable procedures for distributed data with overlapping vari...
متن کاملLingua-Franca: An IDL for Structural Subtyping Distributed Object Systems
Recently the trend has been towards applying object-oriented techniques to address problems of building scalable and maintainable distributed systems. Object-oriented programming increases modularity and data abstraction by supporting encapsulation through narrow, rigidly deened and strongly enforced interfaces to objects. Unfortunately, object-oriented interfaces and mechanisms are usually onl...
متن کامل