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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Baranov, Logic and System Design of Digital Systems, TUT Press, Tallinn (2008).
V. Sklyarov, I. Skliarova, A. Barkalov, and L. Titarenko, Synthesis and Optimization of FPGA-Based Systems; Lecture Notes in Electrical Engineering, Vol. 294, Springer, Cham (2014). https://doi.org/10.1007/978-3-319-04708-9.
J. Baillieul and T. Samad (eds.), Encyclopedia of Systems and Control, Springer, 1st ed., London (2015).
G. De Micheli, Synthesis and Optimization of Digital Circuits, McGraw-Hill, New York (1994).
A. Barkalov, L. Titarenko, M. Kolopienczyk, K. Mielcarek, and G. Bazydlo, Logic Synthesis for FPGA-Based Finite State Machines; Studies in Systems, Decision and Control, Vol. 38, Springer, Cham (2016). https://doi.org/10.1007/978-3-319-24202-6.
A. A. Barkalov and R. M. Babakov, “Operational formation of state codes in microprogram automata,” Cybern. Syst. Analysis, Vol. 47, No. 2, 193–197 (2011). https://doi.org/10.1007/s10559-011-9301-y.
R. M. Babakov and A. A. Barkalov, “Determining the area of efficient application of a microprogrammed finite-state machine with datapath of transitions,” Cybern. Syst. Analysis, Vol. 54, No. 3, 366–375 (2018). https://doi.org/10.1007/s10559-018-0038-8.
R. M. Babakov and A. A. Barkalov, “Algebraic interpretation of a microprogram finite-state machine with datapath of transitions,” Cybern. Syst. Analysis, Vol. 52, No. 2, 191–198 (2016). https://doi.org/10.1007/s10559-016-9814-5.
R. M. Babakov and A. A. Barkalov, “Structural classification of methods for synthesis of a microprogram finite-state machine with datapath of transitions,” Cybern. Syst. Analysis, Vol. 55, No. 2, 167–173 (2019). https://doi.org/10.1007/s10559-019-00121-y.
I. Grout, Digital Systems Design with FPGAs and CPLDs, Elsevier Science, Amsterdam (2011).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Kibernetyka ta Systemnyi Analiz, No. 2, March–April, 2023, pp. 18–26
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Babakov, R.M., Barkalov, A.A. A Matrix Method for Detecting Formal Solutions to the Problem of Algebraic Synthesis of a Finite-State Machine with a Datapath of Transitions. Cybern Syst Anal 59, 190–198 (2023). https://doi.org/10.1007/s10559-023-00554-6
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10559-023-00554-6