Treffer: АЛГОРИТМ АЛГЕБРАЇЧНОГО СИНТЕЗУ МІКРОПРОГРАМНОГОАВТОМАТА НА ОСНОВІ ПЕРЕБОРУ ОПЕРАЦІЙ.

For a finite state machine with a datapath of transitions, a new algebraic synthesis algorithm is proposed that combines the enumeration of state coding ways with the enumeration of transition operations. The algorithm is based on the representation of any transition operation in the form of an arithmetic-logical operator over two operands, which are the code of the state machine's current state and a constant of the corresponding format. This allows you to automate the enumeration of transition operations by enumerating the constants in the used operations within the range of values of the state codes of the finite state machine. The result of the algorithm is a set of solutions of the algebraic synthesis problem, each of which contains values of the state codes and a set of values of the constants of the used operations. The combination of enumeration of transition operations with enumeration of state coding ways expands the search area and increases the number of solutions found for the algebraic synthesis problem compared to the prototype algorithm that does not use enumeration of transition operations. A software implementation of the proposed algorithm was performed, confirming its correctness and effectiveness. [ABSTRACT FROM AUTHOR]

Copyright of Cybernetics & Systems Analysis / Kibernetiki i Sistemnyj Analiz is the property of V.M. Glushkov Institute of Cybernetics of NAS of Ukraine and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)