Automation of Anti-Race State Encoding of Asynchronous FSM for Robust Systems

Abstract

The paper presents a description and testing of an improved states encoding algorithm for asynchronous finite state machine (FSM). It is based on the concept of anti-race encoding, according to which the transition between two adjacent FSM states should be accompanied by switching of only a single trigger. During the research process, in order to find the best solution, a number of original algorithms were proposed, among which was a heuristic encoding algorithm that matches the FSM state transition diagram with n-dimensional binary space. In addition, an exhaustive (or "brutal-force") search algorithms for all possible states was developed. As a separate accompanying task, an algorithm for generation of transitional states sequences between the given set of generated state signatures was created. All the developed algorithms were implemented in the form of software modules (SM) and were used to search for optimal FSM state encoding configurations. A comparative analysis of the encoding results obtained by these SM is also presented.