|
|
Publications in Math-Net.Ru
-
On the satisfiability and model checking for one parameterized extension of linear-time temporal logic
Model. Anal. Inform. Sist., 28:4 (2021), 356–371
-
On the model checking problem for some extension of CTL*
Model. Anal. Inform. Sist., 27:4 (2020), 428–441
-
On the modeling of sequential reactive systems by means of real time automata
Model. Anal. Inform. Sist., 27:4 (2020), 396–411
-
Efficient equivalence checking technique for some classes of finite-state machines
Model. Anal. Inform. Sist., 27:3 (2020), 260–303
-
On the possibility of secure program obfuscation in some model of cloud computing
Proceedings of ISP RAS, 31:6 (2019), 145–162
-
On the expressive power of some extensions of linear temporal logic
Model. Anal. Inform. Sist., 25:5 (2018), 506–524
-
On the verification of strictly deterministic behavior of timed finite state machines
Proceedings of ISP RAS, 30:3 (2018), 325–340
-
On the model checking of finite state transducers over semigroups
Proceedings of ISP RAS, 30:3 (2018), 303–324
-
On the minimization problem for sequential programs
Model. Anal. Inform. Sist., 24:4 (2017), 415–433
-
On the minimization of finite state transducers over semigroups
Model. Anal. Inform. Sist., 23:6 (2016), 741–753
-
Vermont – a toolset for verification of software defined networks
St. Petersburg Polytechnical University Journal. Computer Science. Telecommunication and Control Sys, 2015, no. 1(212), 74–87
-
On the application of equivalence checking algorithms for program minimization
Proceedings of ISP RAS, 27:4 (2015), 145–174
-
Modeling and analysis of the behavior of successive reactive programs
Proceedings of ISP RAS, 27:2 (2015), 221–250
-
On the update problems for software defined networks
Model. Anal. Inform. Sist., 21:6 (2014), 57–70
-
A Formal Model and Verification Problems for Software Defined Networks
Model. Anal. Inform. Sist., 20:6 (2013), 36–51
-
On the Designing of Model Checkers for Real-Time Distributed Systems
Model. Anal. Inform. Sist., 19:6 (2012), 45–56
-
The application of adaptive symmetry reduction for LTL model checking
Model. Anal. Inform. Sist., 17:4 (2010), 78–87
-
Using algebraic models of programs for detecting metamorphic malwares
Fundam. Prikl. Mat., 15:5 (2009), 181–198
-
On complexity of the anti-unification problem
Diskr. Mat., 20:1 (2008), 131–144
-
Approximation of abstract semantics by formal models of programs
Diskr. Mat., 10:4 (1998), 119–141
-
Automata models of programs
Dokl. Akad. Nauk SSSR, 309:1 (1989), 24–27
-
Automaton models of Turing machines
Dokl. Akad. Nauk SSSR, 291:2 (1986), 280–284
-
From the editors of the issue
Model. Anal. Inform. Sist., 28:4 (2021), 322–324
-
From the editors of the issue
Model. Anal. Inform. Sist., 27:4 (2020), 372–374
-
From the editors of the issue
Model. Anal. Inform. Sist., 26:4 (2019), 473–474
-
Even simple processes of $\pi$-calculus are hard for analysis
Model. Anal. Inform. Sist., 25:6 (2018), 589–606
-
From the editors of the special issue
Model. Anal. Inform. Sist., 25:5 (2018), 463–464
-
From the editor of the special issue
Model. Anal. Inform. Sist., 24:6 (2017), 675–676
© , 2026