Skip to main content
Log in

Logical synthesis of the control algorithm in a system with Boolean variables

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

Abstract

Consideration was given to the problem of control synthesis in systems obeying Boolean equations with a time parameter. An algorithm was suggested to solve the problem on the basis of the method of substitutions relating the state variables at the subsequent time instants with the current values. The advantage of the proposed method over the Boolean differential, for example, lies in that there is no need to seek all solutions of the initial system of disjuncts, as well as in that it is possible to determine the substitutions once and forever and use them for various initial and objective system states.

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

Access this article

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. Bochmann, D. and Posthoff, Ch., Binäre dynamische Systeme, Berlin: Akademie, 1981. Translated under the title Dvoichnye dinamicheskie sistemy, Moscow: Energoatomizdat, 1986.

    MATH  Google Scholar 

  2. Popov, E.V. and Firdman, G.R., Algoritmicheskie osnovy intellektual’nykh robotov i iskusstvennogo intellekta (Algorithmic Fundamentals of Intelligent Robots and Artificial Intelligence), Moscow: Nauka, 1976.

    Google Scholar 

  3. Novikov, P.S., Elementy matematicheskoi logiki (Elements ofMathematical Logic), Moscow: Nauka, 1973.

    Google Scholar 

  4. German, O.V. and Semeryuk, D.V., On the Polynomially Solvable Problem of Designing Behavior of the Intelligent Robot, Autom. Remote Control, 2001, vol. 62, no. 2, pp. 181–189.

    Article  MATH  MathSciNet  Google Scholar 

  5. German, O.V. and Zan’ko, D.V., Design of the Control Algorithm in a System of Production Rules with Time Parameter, Autom. Remote Control, 2003, vol. 64, no. 5, pp. 815–823.

    Article  MATH  MathSciNet  Google Scholar 

  6. Garey, M.L. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completness, San Francisco: Freeman, 1979. Translated under the title Vychislitel’nye mashiny i trudnoreshaemye zadachi, Moscow: Mir, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to O. V. German.

Additional information

Original Russian Text © O.V. German, O.I. Sadovskaya, 2014, published in Avtomatika i Telemekhanika, 2014, No. 3, pp. 144–158.

Rights and permissions

Reprints and permissions

About this article

Cite this article

German, O.V., Sadovskaya, O.I. Logical synthesis of the control algorithm in a system with Boolean variables. Autom Remote Control 75, 526–536 (2014). https://doi.org/10.1134/S0005117914030096

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117914030096

Keywords

Navigation