Abstract
The problem of constructing a computer program that implements finite automata is considered and possible methods of solution are discussed. The proposed method of synthesis is based on the use of the descriptive structure of an automaton. The approach is itself based on an interpretation of languages for the description of automata as programming languages. For this purpose, virtual machines of well-known automaton description languages are described. The advantage of the approach lies in the possibility for automation of the transformation: model—algorithm—program.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ershov, A.P. and Lyapunov, A.A., On the Formalization of the Concept of a Program, Kibernetika, 1967, no. 5
Kotov, V.E., Vvedenie v teoriyu skhem program (Introduction to the Theory of Program Schemata), Novosibirsk: Nauka, 1978.
Rutledge, J., On Janov’s [Yazov’s] Program Schemata, J. Assoc. Comp. Mach., 1964, no. 11, no. 1, pp. 1–9.
Blikle, A., A Survey of Input-Output Semantics and Program Verification, Prace IPI PAN (Warsaw), 1979, vol. 344.
Ty-ugu, E.Kh., On the Approach to Practical Program Synthesis, Kibernetika, 1976, no. 6.
Hoare, C.E.R., Consistent, Mutually Complementary Theories of Semantics of Programming Languages, in Semantika yazykov programmirovaniya (Semantics of Programming Languages), Moscow: Mir, 1980.
Pratt, W.C. and Brown, F.M., Automated Design of Microprocessor-based Controllers, IEEE Trans. Indust. Electr. Control Instrument., 1975, vol. 22, no. 3.
Manna, Z. and Waldinger, R., Synthesis: Dreams->Programs, IEEE Trans. Software Engin., 1979, vol. 5, no. 4.
Shalyto, A.A., The use of Graph Circuits and Transition Graphs in Program Implementation of Logical Control Algorithms. Part 1, Avtomat. Telemekhan., 1996, no. 6, pp. 148–158.
Gavrilov, M.A., Devyatkov, V.V., and Pupyrev, E.I., Logicheskoe proektirovanie diskretnykh avtomatov (Logical Design of Discrete Automata), Moscow: Nauka, 1977.
Glushkov, V.M. et al., On the Technique of Designing Computing Machines in the PROEKT System, Kibernetika, 1971, no. 2.
Trakhtenbrot, B.A. and Barzdin’, Ya.M., Konechnyi avtomaty: povedenie, sintez (Finite Automata: Behavior, Synthesis), Moscow: Nauka, 1970.
Gill, A., Linear Sequential Circuits: Analysis, Synthesis, and Applications, New York: McGraw-Hill, 1967.
Lee, C.J., Representation of Switching Circuits by Binary-decision Program, Bell Syst. Tech., J., 1959, vol. 38, no. 4.
Baranov, S.I., Sintez mikroprogrammnykh automat (Synthesis of Microprogramming Automata), Leningrad: Energiya, 1974.
Cheremisinov, D.I., Generation of Programs in the LyaPAS-M Language that Implement Finite Automata, in Algoritmy resheniya logiko-kombinatornykh zadach (Algorithms for the Solution of Logico-combinatorial Problems), Minsk: Institute of Technical Cybernetics, Academy of Sciences of Belarus. SSR., 1979.
Usacheva, N.A., Search for Syntactic Errors in L-Programs, in Logicheskii yazyk dlya predstavleniya algoritmov sinteza releynykh ustroistv (A Logical Language for Representing Algorithms for the Synthesis of Relay Devices), Moscow: Nauka, 1966.
Shalyto, A.A., Automaton Design of Programs. Algorithmization and Programming of Problems of Logical Control, Teor. Sist. Uprav., 2000, no. 6, pp. 63–81.
Scott, K., UML Explained, Boston: Addison-Wesley, 2001.
Shopyrin, D.G. and Shalyto, A.A., Synchronous Programming, Infor.-Upravlyashch. Sist., 2004, no. 3, pp. 35–42.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © D.I. Cheremisinov, 2007, published in Avtomatika i Vychislitel’naya Tekhnika, 2007, No. 4, pp. 51–62.
About this article
Cite this article
Cheremisinov, D.I. Synthesis of computer programs that implement finite automata. Aut. Conrol Comp. Sci. 41, 215–223 (2007). https://doi.org/10.3103/S0146411607040050
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.3103/S0146411607040050