Computational study of activation dynamics on networks of arbitrary structure
Авторы: Semenov A., Gorbatenko D., Kochemazov S.
Журнал: Springer Proceedings in Mathematics and Statistics
Отчётный год: 2018
Аннотация: In this paper, we present the results on describing and modeling dynamical properties of collective systems. In particular, we consider the problems of activation and deactivation of collectives, represented by networks, by establishing special agents called activators and deactivators in a network. Such problems are combinatorial and to solve them, we employ the algorithms for solving Boolean satisfiability problem (SAT). Thus, we describe the general technique for reducing the problems from a considered class to SAT. The paper presents the novel approach to analysis of problems related to Computer Security. In particular, we propose to study the developing and blocking of attacks on computer networks as the processes of activation/deactivation. We give a number of theoretical properties of corresponding discrete dynamical systems. For the problems of blocking attacks on computer networks, the corresponding reduction to SAT was implemented and tested. At the present moment using state-of-the-art SAT solvers, it is possible to solve such problems for networks with 200 vertices.
Индексируется WOS: 0
Индексируется Scopus: 1
Индексируется РИНЦ: 1
Публикация в печати: 0
Добавил в систему: