|
|
|
Publications in Math-Net.Ru |
Citations |
|
2022 |
| 1. |
A. M. Mironov, “Mathematical model and methods of verification of cryptographic protocols”, Intelligent systems. Theory and applications, 26:2 (2022), 85–144  |
| 2. |
A. M. Mironov, “Process approach to modeling and verification of parallel programs”, Intelligent systems. Theory and applications, 26:1 (2022), 101–106 |
|
2021 |
| 3. |
A. M. Mironov, “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 |
|
2020 |
| 4. |
A. M. Mironov, “Verification of functional programs by state diagrams”, Intelligent systems. Theory and applications, 24:1 (2020), 25–54 |
|
2018 |
| 5. |
R. A. Ishchenko, A. S. Podkolzin, D. N. Zhuk, S. V. Moiseev, A. M. Mironov, K. A. Golikov, P. S. Dergach, A. V. Galatenko, I. L. Mazurenko, A. Yu. Konovalov, E. A. Kurganov, “Reports from the Automata Theory seminar”, Intelligent systems. Theory and applications, 22:4 (2018), 137–142 |
| 6. |
A. M. Mironov, “New mathematical model of authentication protocols and verification method based on this model”, Intelligent systems. Theory and applications, 22:4 (2018), 79–98 |
|
2017 |
| 7. |
A. M. Mironov, “Verification of programs by the method of invariants”, Intelligent systems. Theory and applications, 21:4 (2017), 31–49 |
1
|
| 8. |
A. M. Mironov, “Security Protocols, Part 1”, Intelligent systems. Theory and applications, 21:3 (2017), 65–105 |
|
2016 |
| 9. |
A. M. Mironov, “Верификация криптографических протоколов на основе понятия наблюдаемой эквивалентности”, Intelligent systems. Theory and applications, 20:3 (2016), 214–219 |
| 10. |
A. M. Mironov, “Main concepts of a theory of probabilistic automata (part 2)”, Intelligent systems. Theory and applications, 20:2 (2016), 283–330 |
1
|
| 11. |
A. M. Mironov, “Main concepts of a theory of functional programs”, Intelligent systems. Theory and applications, 20:1 (2016), 79–180 |
|
2015 |
| 12. |
A. M. Mironov, “Realizability of probabilistic reactions by finite probabilistic automata”, Inform. Primen., 9:3 (2015), 85–96  |
| 13. |
A. M. Mironov, “Main concepts of a theory of probabilistic automata”, Intelligent systems. Theory and applications, 19:4 (2015), 75–116 |
| 14. |
A. M. Mironov, A. G. Miheev, V. E. Pyatetsky, “The algorithm of check of number of control flows in business process instance finiteness”, Probl. Upr., 2015, no. 1, 30–37 |
|
2014 |
| 15. |
A. M. Mironov, S. L. Frenkel, “Minimization of probabilistic models of programs”, Fundam. Prikl. Mat., 19:1 (2014), 121–163  ; J. Math. Sci., 211:3 (2015), 381–412  |
3
|
| 16. |
A. M. Mironov, S. L. Frenkel, “A method of enhancing probabilistic verification efficiency for computer and telecommunication systems”, Inform. Primen., 8:4 (2014), 58–69 |
| 17. |
A. M. Mironov, “A method of proving the observational equivalence of processes with message passing”, Inform. Primen., 8:2 (2014), 55–69 |
|
2005 |
| 18. |
A. M. Mironov, D. Yu. Zhukov, “Математическая модель и методы верификации программных систем”, Informatsionnye Tekhnologii i Vychslitel'nye Sistemy, 2005, no. 1, 49–67 |
|
2003 |
| 19. |
A. M. Mironov, “Fuzzy modal logics”, Fundam. Prikl. Mat., 9:1 (2003), 201–230  ; J. Math. Sci., 128:6 (2005), 3461–3483 |
22
|
|
1992 |
| 20. |
A. M. Mironov, “Canonical realization of a partial response morphism in the class of decomposable systems”, Uspekhi Mat. Nauk, 47:1(283) (1992), 213–214 ; Russian Math. Surveys, 47:1 (1992), 263–264  |
|
1990 |
| 21. |
A. M. Mironov, “Universal decomposable systems”, Dokl. Akad. Nauk SSSR, 315:2 (1990), 302–308 ; Dokl. Math., 42:3 (1991), 777–783 |
|
| Presentations in Math-Net.Ru |
|
|
| Organisations |
|
| |
|
|
Contact us: