Skip to main content
SpringerLink
Log in

On a class of high-level finite-state automata

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

Abstract

An extension of a hierarchical model of automaton programs is proposed. New elements help shorten the transition graphs of automata, without complicating the logic of automata-based programs.

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. Shalyto, A.A., Switch-tekhnologiya. Algoritmizatsiya i programmirovanie zadach logicheskogo upravleniya (Switch Technology. Algorithmization and Programming of Logical Control Problems), Saint Petersburg: Nauka, 1998, http://is.ifmo.ru/books/switch/1/.

    MATH  Google Scholar 

  2. Shalyto, A.A. and Tukkel, N.I., Switch Technology: an Automated Approach to Constructing Software for “Reaction” Systems, Programmirovanie, 2001, no. 5, pp. 45–62, http://is.ifmo.ru/works/switch/1/.

  3. Kuzmin, E.V., Hierarchical Model of Automata-Based Programs, Modelirovanie i analiz informatsionnykh system, 2006, vol. 13, no. 1, pp. 27–34, http://is.ifmo.ru/verification/-hamp.pdf.

    Google Scholar 

  4. Shalyto, A.A., Tukkel, N.I., and Shamgunov, N.N., Towers of Hanoi and Automata, Programmist, 2002, no. 8, pp. 82–90, http://is.ifmo.ru/works/hanoy/

  5. Volchenkov, S.G. and Bogomolov, Yu.V., Metody postroeniya effektivnykh algoritmov: Uchebnoe posobie (Construction Methods of Efficient Algorithms: Manual), Yaroslavl: YarGU, 2004.

    Google Scholar 

  6. Gurov, V.S., Mazin, M.A., and Shalyto, A.A., UniMod: Automaton Programming Tool, Nauchno-tekhnicheskii vestnik. Vyp. 30. Fundamental’nye i prikladnye issledovaniya informatsionnykh sistem i tehnologii, University of Information Technologies, Mechanics and Optics, Saint Petersburg State University, 2006, pp. 32–44, http://is.ifmo.ru/works/-instrsr.pdf

  7. Vinogradov, R.A., Kuzmin, E.V, and Sokolov, V.A., CPN/Tools in Verification of Automata-Based Programs, Modelirovanie i analiz informatsionnykh system, 2006, vol. 13, no. 2, pp. 4–15, http://is.ifmo.ru/verification/-cpnverif.pdf.

    Google Scholar 

  8. Vinogradov, R.A., Kuzmin, E.V, and Sokolov, V.A., Demidov Yaroslavl State University, Simulation and Analysis System for Automata-Based Programs: computer software official registration certificate no. 2007611856, Federal Service for Intellectual Property, Patent and Trademarks, 2007, May 7, http://is.ifmo.ru/verification/-2007-10-01-svidetelstvo.pdf.

Download references

Author information

Authors and Affiliations

  1. Yaroslavl State University, ul. Sovetskaya 14, Yaroslavl, 150000, Russia

    R. A. Vinogradov & V. A. Sokolov

Authors
  1. R. A. Vinogradov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. A. Sokolov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © R.A. Vinogradov, V.A. Sokolov, 2008, published in Avtomatika i Vychislitel’naya Tekhnika, 2008, No. 3, pp. 38–46.

About this article

Cite this article

Vinogradov, R.A., Sokolov, V.A. On a class of high-level finite-state automata. Aut. Conrol Comp. Sci. 44, 398–406 (2010). https://doi.org/10.3103/S0146411610070059

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0146411610070059

Keywords

Search

Navigation