Synchronism Recovery of Discrete Event Systems

Most of the systems are build of components that should stay synchronized for the system to work properly. Usually, the synchronism of these subsystems is maintained through communication and this communication is subject to failures, leading the system to a undesirable state, where the states of the components do not match. In this sense, this paper deals with the problem of resynchronizing components of a system, leading to a global state where the individual states of the subsystems match with each other. In order to do so, an algorithm, using ideas of synchronizing automata, automata that reach a specific state when a synchronizing word is executed, regardless the origin state, is presented. Copyright (C) 2020 The Authors.