Mironov Andrei Mikhailovich

Publications in Math-Net.Ru

1. Mathematical foundations of time series prediction
   
   Intelligent systems. Theory and applications, 28:3 (2024),  47–79
2. Mathematical model and methods of verification of cryptographic protocols
   
   Intelligent systems. Theory and applications, 26:2 (2022),  85–144
3. Process approach to modeling and verification of parallel programs
   
   Intelligent systems. Theory and applications, 26:1 (2022),  101–106
4. A mathematical model of parallel programs and an approach based on it to verification of MPI programs
   
   Model. Anal. Inform. Sist., 28:4 (2021),  394–412
5. Verification of functional programs by state diagrams
   
   Intelligent systems. Theory and applications, 24:1 (2020),  25–54
6. Reports from the Automata Theory seminar
   
   Intelligent systems. Theory and applications, 22:4 (2018),  137–142
7. New mathematical model of authentication protocols and verification method based on this model
   
   Intelligent systems. Theory and applications, 22:4 (2018),  79–98
8. Verification of programs by the method of invariants
   
   Intelligent systems. Theory and applications, 21:4 (2017),  31–49
9. Security Protocols, Part 1
   
   Intelligent systems. Theory and applications, 21:3 (2017),  65–105
10. Верификация криптографических протоколов на основе понятия наблюдаемой эквивалентности
    
    Intelligent systems. Theory and applications, 20:3 (2016),  214–219
11. Main concepts of a theory of probabilistic automata (part 2)
    
    Intelligent systems. Theory and applications, 20:2 (2016),  283–330
12. Main concepts of a theory of functional programs
    
    Intelligent systems. Theory and applications, 20:1 (2016),  79–180
13. Realizability of probabilistic reactions by finite probabilistic automata
    
    Inform. Primen., 9:3 (2015),  85–96
14. Main concepts of a theory of probabilistic automata
    
    Intelligent systems. Theory and applications, 19:4 (2015),  75–116
15. The algorithm of check of number of control flows in business process instance finiteness
    
    Probl. Upr., 2015, no. 1,  30–37
16. Minimization of probabilistic models of programs
    
    Fundam. Prikl. Mat., 19:1 (2014),  121–163
17. A method of enhancing probabilistic verification efficiency for computer and telecommunication systems
    
    Inform. Primen., 8:4 (2014),  58–69
18. A method of proving the observational equivalence of processes with message passing
    
    Inform. Primen., 8:2 (2014),  55–69
19. Математическая модель и методы верификации программных систем
    
    Informatsionnye Tekhnologii i Vychslitel'nye Sistemy, 2005, no. 1,  49–67
20. Fuzzy modal logics
    
    Fundam. Prikl. Mat., 9:1 (2003),  201–230
21. Canonical realization of a partial response morphism in the class of decomposable systems
    
    Uspekhi Mat. Nauk, 47:1(283) (1992),  213–214
22. Universal decomposable systems
    
    Dokl. Akad. Nauk SSSR, 315:2 (1990),  302–308