Skip to main content
SpringerLink
Log in

Functional Renewal of Behavior of Systems: Numerical Methods

  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

The principles of functional renewal of the behavior of technical systems based on the functional capabilities in the design are stated. A finite deterministic automaton is used as the model. The functional renewal problem is solved within the framework of the theory of universal automata. A class of automata admitting modeling by a family of polynomials is described. The numerical model of automaton behavior is helpful in applying algebraic tools to solve the functional behavior renewal problem. For this automaton class, a universal enumerator is designed and analyzed, and a method of constructing a renewal sequence is described.

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.

Similar content being viewed by others

REFERENCES

  1. Parkhomenko, P.P. and Sogomonyan, E.S., Osnovy tekhnicheskoi diagnostiki, optimizatsii algoritmov diagnostirovaniya, apparaturnye sredstva (Elements of Technical Diagnostics: Optimization of Diagnostic Algorithms and Hardware), Moscow: Energoatomizdat, 1981.

    Google Scholar 

  2. Sytnik, A.A., Enumerability in Automaton Behavior Renewal, Dokl. Ross. Akad. Nauk, 1993, vol. 238, pp. 25, 26.

    Google Scholar 

  3. Sytnik, A.A., Automata Renewal Methods and Models, Avtom. Telemekh., 1992, no. 11, pp. 35-47.

    Google Scholar 

  4. Posokhina, N.I., An Approach to Designing Automata Enumerators, in Teor. probl. inform. i ee prilozhenii (Theoretical Problems in Information and Applications), Saratov: “Kolledz,” 1997, vol. 1, pp. 101-109.

    Google Scholar 

  5. Shul'ga, T.E., Necessary Conditions for Automaton Functions to be Modeled by a Power Polynomial, in Teor. probl. inform. i ee prilozhenii (Theoretical Problems in Information and Applications), Saratov: “Kolledz,” 1998, vol. 2, pp. 145-153.

    Google Scholar 

  6. Shul'ga, T.E., Numerical Methods for the Renewability of the Behavior of Finite Deterministic Automata by a Power Polynomial, in Teor. probl. inform. i ee prilozhenii (Theoretical Problems in Information and Applications), Saratov: “Kolledz,” 1997, vol. 1, pp. 132-137.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Saratov State University, Saratov, Russia

    A. A. Sytnik & T. E. Shul'ga

Authors
  1. A. A. Sytnik
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. T. E. Shul'ga
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sytnik, A.A., Shul'ga, T.E. Functional Renewal of Behavior of Systems: Numerical Methods. Automation and Remote Control 64, 1620–1634 (2003). https://doi.org/10.1023/A:1026069608378

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1026069608378

Keywords

Search

Navigation