A communicating finite automata approach to modeling distributed computation and its application to distributed decision-making

A modeling technique for distributed computation based on a combination of directed graphs and finite automata is described. The paradigm of distributed decision-making (DDM) is used to illustrate the technique for its two primary purposes: providing a standard specification mechanism for different algorithms for solving the same problem and providing a common mechanism for objective quantitative evaluation and comparison of alternative DDM algorithms. This is accomplished through the definition of the terms performance and efficiency as they relate to the domain of DDM. The two terms, which have precise meanings with respect to the analysis of sequential algorithms, currently lack a common interpretation in the environment of DDM. In particular, they need to be expressed in terms of the information movement necessary to share state information. The method has been used extensively to conduct analyses of several distribution scheduling algorithms. This paper focuses on the model specification properties.<
>