|
|
Publications in Math-Net.Ru
-
Studying load issues in software-defined networks
Proceedings of ISP RAS, 36:1 (2024), 23–34
-
On preset homing and synchronizing sequences for observable input/output automata
Avtomat. i Telemekh., 2023, no. 6, 67–78
-
Implementation of distributed and parallel computing in the SDN network
Proceedings of ISP RAS, 34:3 (2022), 159–172
-
Secure implementing a virtual network on the SDN data plane
Proceedings of ISP RAS, 33:1 (2021), 123–136
-
Perfect sets of paths in the full graph of SDN network switches
Proceedings of ISP RAS, 32:4 (2020), 245–260
-
Testing switch rules in software defined networks
Proceedings of ISP RAS, 30:6 (2018), 69–88
-
Directed distributed system: backtracking problem
Proceedings of ISP RAS, 30:2 (2018), 167–194
-
Asynchronous distributed algorithms for static and dynamic directed rooted graphs
Proceedings of ISP RAS, 30:1 (2018), 69–88
-
Deriving synchronizing and homing sequences for input/output automata
Model. Anal. Inform. Sist., 24:6 (2017), 730–742
-
Distributed algorithms on rooted undirected graphs
Proceedings of ISP RAS, 29:5 (2017), 283–310
-
A general approach to solving problems on graphs by collective automata
Proceedings of ISP RAS, 29:2 (2017), 27–76
-
Size of the memory for storage of ordered rooted graph
Proceedings of ISP RAS, 29:2 (2017), 7–26
-
Automata system: determinism conditions and testing
Proceedings of ISP RAS, 28:1 (2016), 151–184
-
Automata system: composition according to graph of links
Proceedings of ISP RAS, 28:1 (2016), 131–150
-
Testing of automata system
Proceedings of ISP RAS, 28:1 (2016), 103–130
-
Parallel calculations on dynamic graph
Proceedings of ISP RAS, 27:2 (2015), 189–220
-
Monitoring of dynamically changed graph
Proceedings of ISP RAS, 27:1 (2015), 69–96
-
Graph learning by a set of automata. The nondeterministic case
Proceedings of ISP RAS, 27:1 (2015), 51–68
-
Safe simulation testing of systems with refusals and destructions
Model. Anal. Inform. Sist., 17:4 (2010), 27–40
© , 2024