Skip to main content
Log in

Modification of the method of generation of control finite-state machines with continuous actions based on training examples

  • Discrete Systems
  • Published:
Journal of Computer and Systems Sciences International Aims and scope

Abstract

Control finite-state machines can be used in the development of reliable control systems due to their clarity and because it is possible to formally verify them. The paper deals with resolving the problem of the generation of machines that control plants with complex behavior based on training examples. The input and output actions of the machines are given by real numbers. A method for the generation of machines is proposed. It is a modification of the previously proposed approaches based on the genetic and ant colony optimization algorithms. Changes include a new way of representing machines and improving the fitness function. The method makes it possible to generate machines whose behavior is more consistent with training examples than the behavior of machines generated by the known approaches.

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. D. Harel and A. Pnueli, “On the development of reactive systems,” in Logic and Models of Concurrent Systems, Ed. by K. Apt, NATO Advanced Study Institute on Logic and Models for Verification and Specification of Concurrent Systems Series (Springer-Verlag, 1985), pp. 477–498.

    Chapter  Google Scholar 

  2. D. Harel and M. Politi, Modeling Reactive Systems with Statechart. The Statemate Approach (McGraw-Hill, New York, 1998).

    Google Scholar 

  3. N. I. Polikarpova and A. A. Shalyto, Automata-Based Programming (Piter, St.-Petersburg, 2011) [in Russian]. http://is.ifmo.ru/books/_book.pdf

    Google Scholar 

  4. N. Walkinshaw, K. Bogdanov, M. Holcombe, et al., “Reverse engineering state machines by interactive grammar inference,” in Proceedings of the 14th Working Conference on Reverse Engineering, WCRE’07 (IEEE Computer Society Press, Vancouver, 2007), pp. 209–218.

    Google Scholar 

  5. N. Walkinshaw, R. Taylor, and J. Derrick, “Inferring extended finite state machine models from software executions,” in Proceedings of the 20th Working Conference on Reverse Engineering WCRE’13 (IEEE Computer Society Press, Koblenz, 2013), pp. 301–310.

    Google Scholar 

  6. F. N. Tsarev and A. A. Shalyto, “Application of genetic programming for automata generation in the ‘artificial ant’ problem,” in Proceedings of the 4th International Scientific-Practical Conference on Integrated Models and Soft Computing in Artificial Intelligence (Fizmatlit, Moscow, 2007), Vol. 2, pp. 590–597. http://is.ifmo.ru/genalg/_ant_ga.pdf

    Google Scholar 

  7. J. R. Koza, Genetic Programming: on the Programming of Computers by Means of Natural Selection (MIT Press, Cambridge, 1992).

    MATH  Google Scholar 

  8. V. M. Kureichik, “Genetic algorithms: state of the art, problems, and perspectives,” J. Comput. Syst. Sci. Int. 38, 137 (1999).

    MATH  Google Scholar 

  9. V. M. Kureichik and S. I. Rodzin, “Evolutionary algorithms: genetic programming,” J. Comput. Syst. Sci. Int. 41, 123 (2002).

    Google Scholar 

  10. L. A. Gladkov, V. V. Kureichik, and V. M. Kureichik, Genetic Algorithms (Fizmatlit, Moscow, 2006) [in Russian].

    Google Scholar 

  11. N. I. Polikarpova, V. N. Tochilin, and A. A. Shalyto, “Method of reduced tables for generation of automata with a large number of input variables based on genetic programming,” J. Comput. Syst. Sci. Int. 49, 265 (2010).

    Article  MATH  Google Scholar 

  12. F. N. Tsarev, “Induction of finite state machines using genetic programming with fitness based on testing,” Inform.-Upravl. Sist., No. 5, 31–36 (2010).

    Google Scholar 

  13. A. V. Aleksandrov, S. V. Kazakov, A. A. Sergushichev, et al., “The use of evolutionary programming based on training examples for the generation of finite state machines for controlling objects with complex behavior,” J. Comput. Syst. Sci. Int. 52, 410 (2013).

    Article  MATH  Google Scholar 

  14. I. Buzhinsky, V. Ulyantsev, and A. Shalyto, “Test-based induction of finite-state machines with continuous output actions,” in Proceedings of the 7th IFAC Conference on Manufacturing Modelling, Management, and Control MIM’13 (IFAC, St.-Petersburg, 2013), pp. 1049–1054.

    Google Scholar 

  15. I. P. Buzhinsky, V. I. Ulyantsev, D. S. Chivilikhin, and A. A. Shalyto, “Inducing finite state machines from training samples using ant colony optimization,” J. Comput. Syst. Sci. Int. 53, 256 (2014).

    Article  MATH  Google Scholar 

  16. FlightGear. http://www.flightgear.org/. Cited September 29, 2014.

  17. M. Dorigo and T. Stützle, Ant Colony Optimization (MIT Press, US, 2004).

    Book  MATH  Google Scholar 

  18. D. Chivilikhin and V. Ulyantsev, “Learning finite-state machines with ant colony optimization,” Lect. Notes Comp. Sci. 7461, 268–275 (2012).

    Article  Google Scholar 

  19. M. López-Ibáñez, J. Dubois-Lacoste, T. Stützle, et al., “The irace package, iterated race for automatic algorithm configuration,” Tech. Report TR/IRIDIA/2011-004 (IRIDIA, Univ. libre de Bruxelles, Belgium, 2011).

    Google Scholar 

  20. Transas. http://www.transas.ru/. Cited September 29, 2014.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to I. P. Buzhinsky.

Additional information

Original Russian Text © I.P. Buzhinsky, S.V. Kazakov, V.I. Ulyantsev, F.N. Tsarev, A.A. Shalyto, 2015, published in Izvestiya Akademii Nauk. Teoriya i Sistemy Upravleniya, 2015, No. 6, pp. 17–30.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Buzhinsky, I.P., Kazakov, S.V., Ulyantsev, V.I. et al. Modification of the method of generation of control finite-state machines with continuous actions based on training examples. J. Comput. Syst. Sci. Int. 54, 853–865 (2015). https://doi.org/10.1134/S1064230715050044

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Navigation