A Matrix Method for Detecting Formal Solutions to the Problem of Algebraic Synthesis of a Finite-State Machine with a Datapath of Transitions.

Autor: Babakov, R. M., Barkalov, A. A.
Předmět:
Zdroj: Cybernetics & Systems Analysis; Mar2023, Vol. 59 Issue 2, p190-198, 9p
Abstrakt: For a finite-state machine with a datapath of transitions, a new method for detecting formal solutions to an algebraic synthesis problem is proposed. It represents the set of finite-state machine transitions in the form of a matrix that contains information about the current state encoding. This matrix is matched to the merged matrix of operations, which contains all possible transformations of state codes using a given set of transition operations. Such an approach allows one to simultaneously compare all transition operations with each finite-state machine transition, which reduces the number of verifications of the existence of a formal solution to the problem of algebraic synthesis. The result is the reduction in the execution time of any algorithms of algebraic synthesis of a finite-state machine with a datapath of transitions based on the enumeration of ways of using the operations to implement automatic transitions. [ABSTRACT FROM AUTHOR]
Databáze: Complementary Index
Externí odkaz: