Geodesic
Genetic algorithm for placing control points in a digital device
Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 17 (2017) no. 3, pp. 353-362.

Voir la notice de l'article provenant de la source Math-Net.Ru

The article considers the problem of placing control points in a digital device in order to increase its controlability. The previously known methods for solving this problem were based on a preliminary analysis of the device topology (structure) for the estimation of such parameters as controllability, observability and testability. The corresponding indicators in many well-known systems for analyzing compliance were calculated using software tools. Carrying out such an analysis is a rather laborious process. In the proposed article, the solution of the problem of placing control points, which is one of the ways to increase the controllability, is based on a fundamentally different approach. This approach also involves the evaluation of the above-mentioned indicators of the device, but this estimate is related to the calculation of the amount of information delivered to various nodes of the device during the process of supplying random input sequences to it. This approach is less labor-intensive than the analysis of the topology (structure) of the digital device. 
@article{ISU_2017_17_3_a10,
     author = {D. V. Speranskiy},
     title = {Genetic algorithm for placing control points in a digital device},
     journal = {Izvestiya of Saratov University. Mathematics. Mechanics. Informatics},
     pages = {353--362},
     publisher = {mathdoc},
     volume = {17},
     number = {3},
     year = {2017},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ISU_2017_17_3_a10/}
}
TY  - JOUR
AU  - D. V. Speranskiy
TI  - Genetic algorithm for placing control points in a digital device
JO  - Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
PY  - 2017
SP  - 353
EP  - 362
VL  - 17
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ISU_2017_17_3_a10/
LA  - ru
ID  - ISU_2017_17_3_a10
ER  - 
%0 Journal Article
%A D. V. Speranskiy
%T Genetic algorithm for placing control points in a digital device
%J Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
%D 2017
%P 353-362
%V 17
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ISU_2017_17_3_a10/
%G ru
%F ISU_2017_17_3_a10
D. V. Speranskiy. Genetic algorithm for placing control points in a digital device. Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 17 (2017) no. 3, pp. 353-362. http://geodesic.mathdoc.fr/item/ISU_2017_17_3_a10/

[1] Khalchev V. F., “Increase of controllability of discrete devices: state and problems”, Izmereniia, kontrol', avtomatizatsiia, 1980, no. 1, 25–30 (in Russian)

[2] Williams T. W., Parker K. P., “Design for Testability A Survey”, IEEE Trans. Comput., 31:1 (1982), 2–15 | DOI

[3] Robach C., Guibert S., “Testability measures: a review”, Computer Systems, 3:3 (1988), 117–126

[4] Bennets R. G., Design of testable logic circuits, Addison Wesley Publ. Company, 1984, 274 pp.

[5] Grason J., “TMEAS, a testability measurement program”, DAC'79 Proceedings of the 16th Design Automation Conference, IEEE Press, Piscataway, NJ, USA, 1979, 156–161 | DOI

[6] Goldstein L. H., “Controlability/observability analysis of digital circuits”, IEEE Transactions on Circuits and Systems, 26:9 (1979), 685–693 | DOI

[7] He M. T., Contreras G. K., Tehranipoor M., Tran D., Winemberg L., “Test-point insertion efficiency analysis for LBIST applications”, IEEE 34th VLSI Test Symposium (VTS) 2016 (Las Vegas, NV, 2016), 1–6 | DOI | MR

[8] Speranskiy D. V., “Testability analysis of discrete devices on information approach base : theory, software, statistical results”, Proc. 6th Intern. Symposium of Technical Diagnostics 89 (Prague, Czech Republic, 1989), v. 2, 439–442

[9] Barashko A. S., Skobtsov Yu. A., Speranskiy D. V., Modeling and testing of discrete devices, Naukova dumka, Kiev, 1992, 286 pp. (in Russian)

[10] Savir J., “Good controllability and observability do not guarantee good testability”, IEEE Transactions on Computers, C-32:12 (1983), 1198–1200 | DOI

[11] Yaglom A. M., Yaglom I. M., Probability and Information, Theory and Decision Library, Kluwer, 1983, 421 pp. | MR | Zbl

[12] Gmurman V. E., Fundamentals of Probability Theory and Mathematical Statistics, Iliffe Books Ltd., 1968, 249 pp. | MR

[13] Skobtsov Yu. A., Speranskiy D. V., Evolutionary calculations, Natsional'nyi otkrytyi universitet “INTUIT”, M., 2015, 326 pp. (in Russian)