| DC Field | Value | Language |
|---|
| dc.contributor.author | Yarmolik, V. N. | - |
| dc.contributor.author | Shevchenko, N. A. | - |
| dc.coverage.spatial | New York | - |
| dc.date.accessioned | 2022-10-06T06:37:35Z | - |
| dc.date.available | 2022-10-06T06:37:35Z | - |
| dc.date.issued | 2022 | - |
| dc.identifier.citation | Yarmolik, V. N. Synthesis of Test Sequences with a Given Switching Activity / Yarmolik V. N., Shevchenko N. A. // Automation and Remote Control. – 2022. – №2(83). – P. 291 – 302. – DOI: 10.1134/S0005117922020114. | ru_RU |
| dc.identifier.uri | https://libeldoc.bsuir.by/handle/123456789/48440 | - |
| dc.description.abstract | The relevance of using test sequences with a given switching activity is discussed. As a mathematical model for generating the tests, a modification of the Antonov–Saleev method for generating Sobol sequences is used. It is based on the use of maximum-rank generating matrices the form of which determines the main properties of the sequences. It is shown that the construction of a generating matrix is reduced to the problem of partitioning an integer, and an algorithm for splitting into summands of a given form is proposed. Procedures for modifying the partition of an integer into summands and for modifying the value of switching activity are
introduced. Three problems are stated for the synthesis of generators of test sequences with a given switching activity. Examples of using the proposed methods and experimental results are considered. | ru_RU |
| dc.language.iso | en | ru_RU |
| dc.publisher | Pleiades Publishing | ru_RU |
| dc.subject | публикации ученых | ru_RU |
| dc.subject | test sequence | ru_RU |
| dc.subject | self-testing of computing systems | ru_RU |
| dc.subject | switching activity | ru_RU |
| dc.title | Synthesis of Test Sequences with a Given Switching Activity | ru_RU |
| dc.type | Article | ru_RU |
| Appears in Collections: | Публикации в зарубежных изданиях
|
