State machine transition to avoid the race conditions in asynchronous sequential logic circuits

Abstract

A new approach, represented by an algorithm is introduced for asynchronous sequential logic circuits. It provides an efficient procedure to avoiding the race conditions. The algorithm procedures have been developed to identify the race conditions and to prevent the system from malfunctioning. Moreover, it provides convenient and efficient procedures without any complexity in hardware or reduction in the system's speed.