no. 1
On the hierarchy of functioning rules in distributed computing
RAIRO - Operations Research - Recherche Opérationnelle, Tome 33 (1999) no. 1, pp. 15-27. 
@article{RO_1999__33_1_15_0,
     author = {Bui, A. and Bui, M. and Lavault, C.},
     title = {On the hierarchy of functioning rules in distributed computing},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {15--27},
     publisher = {EDP-Sciences},
     volume = {33},
     number = {1},
     year = {1999},
     mrnumber = {1717017},
     zbl = {0958.90088},
     language = {en},
     url = {http://archive.numdam.org/item/RO_1999__33_1_15_0/}
}
TY  - JOUR
AU  - Bui, A.
AU  - Bui, M.
AU  - Lavault, C.
TI  - On the hierarchy of functioning rules in distributed computing
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1999
SP  - 15
EP  - 27
VL  - 33
IS  - 1
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/RO_1999__33_1_15_0/
LA  - en
ID  - RO_1999__33_1_15_0
ER  - 
%0 Journal Article
%A Bui, A.
%A Bui, M.
%A Lavault, C.
%T On the hierarchy of functioning rules in distributed computing
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1999
%P 15-27
%V 33
%N 1
%I EDP-Sciences
%U http://archive.numdam.org/item/RO_1999__33_1_15_0/
%G en
%F RO_1999__33_1_15_0
Bui, A.; Bui, M.; Lavault, C. On the hierarchy of functioning rules in distributed computing. RAIRO - Operations Research - Recherche Opérationnelle, Tome 33 (1999) no. 1, pp. 15-27. http://archive.numdam.org/item/RO_1999__33_1_15_0/

1. D. Brand and P. Zafiropulo, On communicating finite-state machines, Journal of the ACM, 198330 (2), pp. 323-342. | MR | Zbl

2. A. Bui, Analyse du fonctionnement d'un type d'algorithmes distribués, Rev. R. de Math. Pures et Appl., 1995, 40 (7-8), pp. 583-593. | MR | Zbl

3. A. Bui, Etude analytique d'algorithmes distribués de routage, Thèse de doctorat, Université Paris-7, 1, 1994.

4. M. Bui, Tuning Distributed Control Algorithms for Optimal Functioning, J. of Global Optimization, 1992, 2, pp. 177-199. | MR | Zbl

5. M. Bui, Résolution du Problème de Multi-Rendez-Vous à l'aide d'un modèle d'algorithme distribué, RAIRO, 1993, 27 (2), pp. 249-264. | Numdam | MR | Zbl

6. T. L. Casavant and J. G. Kuhl, A communicating finite automata approach to modeling distributed computation and its application to distributed décision making, IEEE Trans. on Computers, 1990, 39 (5), pp. 628-639.

7. J. G. Kemeny and J. L. Snell, Finite Markov chains, Springer, 1983. | MR | Zbl

8. B. Rozoy, On distributed languages and models for distributed computation, Res.Rept. No. 563, University Paris-11, 1990.

9. K. M. Chandry and J. Misra, The Drinking Philosophers Problem, ACM TOPLAS, 1984, 6 (4), pp. 632-646.

10. G. Gao and G. V. Bochmann, An Virtual Ring Algorithm for the Distributed Implementation of Multi-Rendez-Vous, Tech. Rept No. 675, Dpt IRO, Université de Montréal, 1990.

11. S. P. Rana and D. K. Banerji, An optimal distributed solution to the dining philosophers, Res. Rept., Waystate University, Détroit, Michigan, 1987.

12. A. Segall, Distributed Network Protocols, IEEE transactions on Information Theory, 1983, 29 (1), pp. 23-25. | MR | Zbl

13. W. D. Tajibnapis A Correctness Proof of a Topology Information Maintenance Protocol for a Distributed Computer Network, Communications of the ACM, 1977, 20 (7), pp. 477-485. | MR | Zbl