|Résumé||We consider networks of processes which interact with beeps. Various beeping models are used. The basic one, defined by Cornejo and Khun assumes that a process can choose either to beep or to listen. If it listens it can distinguish between silence or the presence of at least one beep. The aim of this paper is the study of the resolution of paradigms such as collision detection, computation of the degree of a vertex, of a MIS or a colouring in the framework of beeping models.
Join work with Yves Métivier and Mike Robson |