Journal publications, conference proceedings, and patents
Journal papers:
  • 'Acta Polytechnica Hungarica'. Fabarisov, T., et al. "Model-based Stochastic Error Propagation Analysis for Cyber-Physical Systems." Acta Polytechnica Hungarica Vol. 17 No. 8 (2020): 15-28.
  • 'SIIT'. Fabarisov, Tagir Ildarovich, et al. "Analytical toolset for model-based stochastic error propagation analysis: extension and optimization towards industrial requirements." Системная инженерия и информационные технологии 1.1 (2019): 41-46.
  • 'Industry 4.0'. Fabarisov, T., et al. "The efficiency comparison of the prism and storm probabilistic model checkers for error propagation analysis tasks." Industry 4.0 3.5 (2018): 229-231.
  • 'Sensors & Transducers'. Yusupova, Nafisa I., et al. "Information and Analytical Support for Decision-making in the Management of the ICT Industry in the Regions of the Russian Federation." Sensors & Transducers 234.6 (2019): 44-49.
Conference proceedings:
  • 'ESREL 2020'. Fabarisov, T., et al. "Model-based Fault Injection Experiments for the Safety Analysis of Exoskeleton System." Proceedings of the 30th European Safety and Reliability Conference and the 15th Probabilistic Safety Assessment and Management Conference. 2020.
  • 'EDCC 2019'. Ding, Kai, et al. "On-Line Error Detection and Mitigation for Time-Series Data of Cyber-Physical Systems using Deep Learning Based Methods." 2019 15th European Dependable Computing Conference (EDCC). IEEE, 2019. Conference Distinguished Paper Award.
  • 'ITIDS 2019'. Vidineev, Viacheslav, et al. "LLVM-based C to DEPM transformation tool: New functionality and performance improvements." Информационные технологии интеллектуальной поддержки принятия решений. 2019.
Selected patents:
  • 'RU 2016616700'. "Program for the effectiveness determination of the Genetic Algorithm and Branch and Bound method for solving the Traveling Salesman Problem.
  • 'RU 2016618386'. "Complex analysis of the water bodies pollution in urban territories.
  • 'RU 2016616959'. "Program for solving Travelling Salesman Problem using modification of the Branch and Bound algorithm.