Evtushenko Nina Vladimirovna

Publications in Math-Net.Ru

1. On length of an adaptive distinguishing sequence for a family of observable finite state machines
   
   Proceedings of ISP RAS, 37:6(1) (2025),  7–20
2. Clustering services of distributed networks in which hosts can perform message switching functions
   
   Proceedings of ISP RAS, 37:5 (2025),  7–32
3. A distributed network model in which hosts can perform message switching functions
   
   Proceedings of ISP RAS, 37:4(1) (2025),  7–30
4. Studying load issues in software-defined networks
   
   Proceedings of ISP RAS, 36:1 (2024),  23–34
5. On preset homing and synchronizing sequences for observable input/output automata
   
   Avtomat. i Telemekh., 2023, no. 6,  67–78
6. Implementation of distributed and parallel computing in the SDN network
   
   Proceedings of ISP RAS, 34:3 (2022),  159–172
7. Secure implementing a virtual network on the SDN data plane
   
   Proceedings of ISP RAS, 33:1 (2021),  123–136
8. Deriving homing sequences for finite state machines with timed guards
   
   Model. Anal. Inform. Sist., 27:4 (2020),  376–395
9. Perfect sets of paths in the full graph of SDN network switches
   
   Proceedings of ISP RAS, 32:4 (2020),  245–260
10. On reduced forms of initialized Finite State Machines with timeouts
    
    Proceedings of ISP RAS, 32:2 (2020),  125–134
11. FSM abstraction based method for deriving test suites with guaranteed fault coverage against nondeterministic Finite State Machines with timed guards and timeouts
    
    Proceedings of ISP RAS, 31:4 (2019),  175–188
12. Testing switch rules in software defined networks
    
    Proceedings of ISP RAS, 30:6 (2018),  69–88
13. Deriving adaptive distinguishing sequences for Finite State Machines
    
    Proceedings of ISP RAS, 30:4 (2018),  139–154
14. The effect of partiality and adaptivity on the complexity of FSM state identification problems
    
    Proceedings of ISP RAS, 30:1 (2018),  7–24
15. Deriving synchronizing and homing sequences for input/output automata
    
    Model. Anal. Inform. Sist., 24:6 (2017),  730–742
16. Testing timed nondeterministic finite state machines with the guaranteed fault coverage
    
    Model. Anal. Inform. Sist., 24:4 (2017),  496–507
17. Minimizing finite state machines with time guards and timeouts
    
    Proceedings of ISP RAS, 29:4 (2017),  139–154
18. Deriving test suites with the guaranteed fault coverage for extended finite state machines
    
    Model. Anal. Inform. Sist., 23:6 (2016),  729–740
19. Deriving adaptive checking sequence for nondeterministic Finite State Machines
    
    Proceedings of ISP RAS, 28:3 (2016),  123–144
20. A SPIN-based approach for detecting vulnerabilities in С programs
    
    Model. Anal. Inform. Sist., 18:4 (2011),  131–143
21. Solving parallel equations over $\omega$-languages
    
    Prikl. Diskr. Mat., 2010, no. 2(8),  117–123
22. Solving parallel equations over $\omega$-regular languages
    
    Prikl. Diskr. Mat., 2009, no. supplement № 1,  6–7
23. Adaptive tests derivation for nondeterministic automata
    
    Prikl. Diskr. Mat., 2009, no. 4(6),  90–101
24. Development of the checking set for a component of a sequential automaton network
    
    Avtomat. i Telemekh., 1994, no. 8,  145–153
25. On a probability approach to computing estimates of controllability and observability of a node of a discrete device
    
    Avtomat. i Telemekh., 1993, no. 11,  152–160
26. Design of testable automaton networks
    
    Avtomat. i Telemekh., 1991, no. 3,  143–152
27. Description of Cascade Networks of Finite Automata In Terms of Codings and Coverings
    
    Probl. Peredachi Inf., 18:3 (1982),  74–84