The notion of self-stabilization was first introduced by Dijkstra : it is the property for a system to eventually recover by itself a legitimate state after any perturbation modifying the memory state. This paper proposes a dynamic automatic self-stabilizing protocol. This algorithm runs in the fully asynchronous message-passing model in which messages can also be corrupted. The principle of the algorithm is to compute regularly a global state and if necessary to generate a global reset. When the system is stabilized, the message complexity is O(max(D *m,n^2)) where D is the degree of the communication graph, m the number of links and n the number of processes. This complexity allows a possible implementation.