Scientific and Technical Journal

ELECTROTECHNIC AND COMPUTER SYSTEMS

ISSN Print 2221-3937
ISSN Online 2221-3805
NETWORK METHOD OF EVOLUTION SYNTHESIS OF BEHAVIOR TESTS
Abstract:
In this paper, we present a network decomposition method for synthesizing structured behavioral tests for use as part of diagnosis of distributed information systems (DIS). The network decomposition method is based on the network evolutionary model of DIS testing, which contains a system of test, infecting, realizing, transporting evolutions. The interaction of evolution takes place at three levels: within the component network for an individual network automaton; cooperatively component in the evolutionary implementation and transport of test behavior of a separate component of the automaton network representing DIS; between combining component cooperations. The properties of the network interactions of the model made it possible to determine the features of intercomponent basic automata compositions, parallel, sequential, feedback, evolutionary mutation and crossover operations, fitness and choice functions. Among them, in particular, are the adaptability of mutations, that are altered by means of built-in infectious evolutions, the preparation and repeated immune use of test, realized and transported behavior in the nodes of the automata network, representing DIS. The definition of an algebraic system from base sets of test, realized and transported fragments, as well as signatures of compositional and evolution operations in the automata network, made it possible to propose the basic structure of the network evolutionary method of decomposition synthesis of structured behavioral tests. The parallelism of test evolution, realizing and transporting evolutions of the network model of testing is inherited by the network evolutionary method and allows parallel program-algorithmic realization of the interaction of evolution. As shown by analytical estimates and physical experiments, the network evolutionary method allows to reduce the time of synthesis of tests and preparation of test support in general for the majority of real RIS in comparison with network deterministic methods
Authors:
Keywords
DOI
References
  1. Bakker, A. A., , M. Steen, A. S. Tanenbaum (2006) Wide-Area Distribution Network for Free Software ACM Trans. on Internet Technology,Vol. 6, Aug.– P. 259–281.
  2. Praveen Ranjan Automated Software Testing Using Metahurestic Technique Based on An Ant Colony Optimization Electronic System Design (ISED) / Ranjan Praveen, Srivastava Km Baby // International Symposium, 20–22 Dec. 2010, Bhubaneswar. – P. 235–240.
    Url:http://arxiv.org/ftp/arxiv/papers/1106/1106.2686.pdf
  3. Stuart J., Norvig, Р. (2010)  Russell Artificial Intelligence: a Modern Approach . (Prentice-Hall, Inc. A Simon & Schuster Company Englewood Cliffs, New Jersey,– 1095 p.
    http://www.pearsonhighered.com/educator/product/Artificial-Intelligence-A-Modern-Approach/9780136042594.page
  4. Grindal Mats Handling Combinatorial Explosion in Software Testing / Mats Grindal // Printed by LiU-Tryck, Linköping. 2007. – 89 p.
    http://www.divaportal.org/smash/get/diva2:17568/FULLTEXT01.pdf.
  5. Martynyuk, A. N. (2007)  Network Automata Models for Test Synthesis [Setevye avtomatnye modeli sinteza testov] / A.N. Martynyuk // Kholodil'na Tekhnika I Tekhnologiya, – Odesa. Isd. Odesk.Akad.Harch.Tehnolog.. No2(106).– P.94 – 97.
  6. Skobtsov, Y. A. (2014) Genetic Algorithm of building of functional tests for arithmetic devises [Genetichesky algoritm postroeniya funktsionalnih testov arifmeticheskih ustroistv] Informatsionno-upravlyayuschie sistrmi. Vostochno-Evropeisky journal peredovih technology, – 2/9 (68). – C. 9–
  7. Ivanov, D. E. (2012)  Genetic Algorithms of building of identifier sequences for digital circuits [Geneticheskie algoritmi postroeniya vhodnih identifitsiruyuschih posledovatelnostei tsifrovih ustroistv] Donetsk, DNT,. – 240 p.
  8. Kudryavtsev, V. B. (2009) Automata Behavior Analysis [Analiz Povedeniya Avtomatov] / V.B. Kudryavtsev, I.S. Grunskii, V.A. Kozlovskii // Diskretnaya Matematika, Moskva. RAN, Otdelenie Matematicheskikh Nauk. Tom 21, No1.. P.3–35.  
  9. Sugak, H. S. (2015) Building of behavioral tests for nondeterministic time automata model[Postroenie povedencheskih testov dlya nedeter-minirovannoy vremennoy avtomatnoy modeli] / H.S. Sugak, O.N. Martynyuk // Electrotechnicheskie i computernie sistemi № 17 (93), Odessa. – P. 63–68.
Published:
Last download:
2017-11-16 08:56:53

[ © KarelWintersky ] [ All articles ] [ All authors ]
[ © Odessa National Polytechnic University, 2014. Any use of information from the site is possible only under the condition that the source link! ]
Яндекс.Метрика