Skip to main content
SpringerLink
Log in

Structural Classification of Methods for Synthesis of a Microprogram Finite-State Machine with Datapath of Transitions

  • CYBERNETICS
  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

The authors propose to represent methods of synthesis of a microprogram finite-state machine with datapath of transitions in the form of a structure whose blocks correspond to elements of a mathematical model of the finite-state machine. Five structures have been developed that take into account differences in the initial data and results of the synthesis methods. The described and similar structures can be used to classify existing and future methods for synthesizing this class of finite-state machines.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. V. M. Glushkov, Synthesis of Digital Automata [in Russian], Fizmatgiz, Moscow (1962).

  2. S. I. Baranov, Synthesis of Microprogrammed Automata [in Russian], Energiya, Leninrad (1979).

  3. A. A. Barkalov, Synthesis of Control Units on PLDs [in Russian], DonNTU, Donetsk (2002).

  4. G. DeMicheli, Synthesis and Optimization of Digital Circuits, McGraw-Hill, New York (1994).

  5. A. Barkalov, L. Titarenko, M. Kolopienczyk, K. Mielcarek, and G. Bazydlo, Logic Synthesis for FPGA-Based Finite State Machines, Springer, Cham (2016).

  6. A. A. Barkalov and R. M. Babakov, “Operational formation of state codes in microprogram automata,” Cybernetics and Systems Analysis, Vol. 47, No. 2, 193–197 (2011).

  7. R. M. Babakov, “Algebraic synthesis of a microprogram final-state machine with datapath of transitions,” Information Technology and Computer Engineering, Vol. 2, No. 39, 35–41 (2017).

  8. R. M. Babakov, “Mathematical model of microprogram final finite-state machine with datapath of transitions,” in: Collection of Scientific Papers of DonNTU, Ser. “Informatics, cybernetics and computer engineering,” Iss. 1 (22), 54–57 (2016).

  9. A. A. Barkalov and R. M. Babakov, “Algebraic interpretation of a microprogram finite-state machine with datapath of transitions,” Cybernetics and Systems Analysis, Vol. 52, No. 2, 191–198 (2016).

  10. D. Yu. Katalevsky, Basics of Simulation Modeling and Systems Analysis in Management [in Russian], MSU, Moscow (2011).

  11. M. Glykas (ed.), Fuzzy Cognitive Maps: Advances in Theory, Methodologies, Tools and Applications, Studies in Fuzziness and Soft Computing, Vol. 247, Springer, Berlin–Heidelberg (2010).

  12. R. Axelrod (ed.), Structure of Decision: The Cognitive Maps of Political Elites, Princeton University Press, Princeton, N.J. (1976). 173

Download references

Author information

Authors and Affiliations

  1. Donetsk National University of Vasyl Stus, Vinnytsia, Ukraine

    R. M. Babakov

  2. Uniwersytet Zielonogórski, Zielona Góra, Poland

    A. A. Barkalov

Authors
  1. R. M. Babakov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. A. Barkalov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to R. M. Babakov.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 2, March–April, 2019, pp. 3–9.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Babakov, R.M., Barkalov, A.A. Structural Classification of Methods for Synthesis of a Microprogram Finite-State Machine with Datapath of Transitions. Cybern Syst Anal 55, 167–173 (2019). https://doi.org/10.1007/s10559-019-00121-y

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-019-00121-y

Keywords

Search

Navigation