Inna Petrovska
Inna Petrovska has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Serhii Semenov
Institute of Security and Computer Sciences, University of the National Education Commission, ul. Podchorazych 2, 30-084 Krakow, Poland
2 shared publications - Anastasiya Mekhovykh
Department of Information Technology and Cyber Security, Science Entrepreneurship Technology University, M. Shpaka St., 3, 03113 Kiyv, Ukraine
1 shared publication - Grzegorz Litawa
The Institute of Security and Information Technology, University of the National Education Commission, 30-084 Krakow, Poland
1 shared publication - Heorhii Kuchuk
National Technical University "Kharkiv Polytechnic Institute
1 shared publication - Magdalena Andrzejewska
Institute of Security and Computer Sciences, University of the National Education Commission, 30-084 Krakow, Poland
1 shared publication - Marharyta Melnyk
Department of Information Technology and Cyber Security, Science Entrepreneurship Technology University, M. Shpaka St., 3, 03113 Kiyv, Ukraine
1 shared publication
Latest Publications
- Open Access
- 31 October 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (21) , 11667
Mathematical Model of the Software Development Process with Hybrid Management Elements
Reliable schedule-risk estimation in hybrid software development lifecycles is strategically important for organizations adopting AI in software engineering. This study addresses that need by transforming routine process telemetry (CI/CD, SAST, traceability) into explainable, quantitative predictions of completion time and rework. This paper introduces an integrated probabilistic model of the hybrid software development lifecycle that combines Generalized Evaluation and Review Technique (GERT) network semantics with I-AND synchronization, explicit artificial-intelligence (AI) interventions, and a fuzzy treatment of epistemic uncertainty. The model embeds two controllable AI nodes–an AI Requirements Assistant and AI-augmented static code analysis, directly into the process topology and applies an analytical reduction to a W-function to obtain iteration-time distributions and release-success probabilities without resorting solely to simulation. Epistemic uncertainty on critical arcs is represented by fuzzy intervals and propagated via Zadeh’s extension principle, while aleatory variability is captured through stochastic branching. Parameter calibration relies on process telemetry (requirements traceability, static-analysis signals, continuous integration/continuous delivery, CI/CD, and history). A validation case (“system design → UX prototyping → implementation → quality assurance → deployment”) demonstrates practical use: large samples of process trajectories are generated under identical initial conditions and fixed random seeds, and kernel density estimation with Silverman’s bandwidth is applied to normalized histograms of continuous outcomes. Results indicate earlier defect detection, fewer late rework loops, thinner right tails of global duration, and an approximately threefold reduction in the expected number of rework cycles when AI is enabled. The framework yields interpretable, scenario-ready metrics for tuning quality-gate policies and automation levels in Agile/DevOps settings.
- 31 October 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (21) , 11667
Open AccessMathematical Model of the Software Development Process with Hybrid Management Elements
Reliable schedule-risk estimation in hybrid software development lifecycles is strategically important for organizations adopting AI in software engineering. This study addresses that need by transforming routine process telemetry (CI/CD, SAST, traceability) into explainable, quantitative predictions of completion time and rework. This paper introduces an integrated probabilistic model of the hybrid software development lifecycle that combines Generalized Evaluation and Review Technique (GERT) network semantics with I-AND synchronization, explicit artificial-intelligence (AI) interventions, and a fuzzy treatment of epistemic uncertainty. The model embeds two controllable AI nodes–an AI Requirements Assistant and AI-augmented static code analysis, directly into the process topology and applies an analytical reduction to a W-function to obtain iteration-time distributions and release-success probabilities without resorting solely to simulation. Epistemic uncertainty on critical arcs is represented by fuzzy intervals and propagated via Zadeh’s extension principle, while aleatory variability is captured through stochastic branching. Parameter calibration relies on process telemetry (requirements traceability, static-analysis signals, continuous integration/continuous delivery, CI/CD, and history). A validation case (“system design → UX prototyping → implementation → quality assurance → deployment”) demonstrates practical use: large samples of process trajectories are generated under identical initial conditions and fixed random seeds, and kernel density estimation with Silverman’s bandwidth is applied to normalized histograms of continuous outcomes. Results indicate earlier defect detection, fewer late rework loops, thinner right tails of global duration, and an approximately threefold reduction in the expected number of rework cycles when AI is enabled. The framework yields interpretable, scenario-ready metrics for tuning quality-gate policies and automation levels in Agile/DevOps settings.
- Open Access
- 6 July 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (13) , 7583
Mathematical Model of Data Processing in a Personalized Search Recommendation System for Digital Collections
This paper presents a probabilistic-temporal modeling approach for analyzing data processing stages in a personalized recommendation system for digital heritage collections. The methodology is based on (Graphical Evaluation and Review Technique) GERT network formalism, which enables the representation of complex probabilistic workflows with feedbacks and alternative branches. For each processing stage, corresponding GERT-schemes were developed, and equivalent transfer functions were derived. Using Laplace transform inversion techniques, probability density functions of processing time were recovered, followed by the calculation of key statistical metrics, including expectation, standard deviation, and quantiles. The results demonstrate that the proposed approach allows for detailed temporal performance evaluation, including the estimation of time exceedance probabilities at each stage. This provides a quantitative basis for optimizing recommendation system design and highlights the applicability of GERT-based modeling to intelligent data-driven services in the cultural domain.
- 6 July 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (13) , 7583
Open AccessMathematical Model of Data Processing in a Personalized Search Recommendation System for Digital Collections
This paper presents a probabilistic-temporal modeling approach for analyzing data processing stages in a personalized recommendation system for digital heritage collections. The methodology is based on (Graphical Evaluation and Review Technique) GERT network formalism, which enables the representation of complex probabilistic workflows with feedbacks and alternative branches. For each processing stage, corresponding GERT-schemes were developed, and equivalent transfer functions were derived. Using Laplace transform inversion techniques, probability density functions of processing time were recovered, followed by the calculation of key statistical metrics, including expectation, standard deviation, and quantiles. The results demonstrate that the proposed approach allows for detailed temporal performance evaluation, including the estimation of time exceedance probabilities at each stage. This provides a quantitative basis for optimizing recommendation system design and highlights the applicability of GERT-based modeling to intelligent data-driven services in the cultural domain.
- 20 September 2023
- Published by National Technical University Kharkiv Polytechnic Institute in Advanced Information Systems
- Vol. 7 (3) , 67-73
ADAPTIVE RESOURCE ALLOCATION METHOD FOR DATA PROCESSING AND SECURITY IN CLOUD ENVIRONMENT
Subject of research: methods of resource allocation of the cloud environment. The purpose of the research: to develop a method of resource allocation that will improve the security of the cloud environment. At the same time, effective data processing should be achieved. Method characteristics. The article discusses the method of adaptive resource allocation in cloud environments, focusing on its significance for data processing and enhanced security. A notable feature of the method is the consideration of external influences when calculating the characteristics of cloud resource requests and predicting resource requests based on a time series test. The main idea of this approach lies in the ability to intelligently distribute resources while considering real needs, which has the potential to optimize both productivity and confidentiality protection simultaneously. Integrating adaptive resource allocation methods not only improves data processing efficiency in cloud environments but also strengthens mechanisms against potential cyber threats. Research results. To ensure timely resource allocation, the NSGA-II algorithm has been enhanced. This allowed reducing the resolution time of multi-objective optimization tasks by 5%. Additionally, research results demonstrate that effective utilization of various types of resources on a physical machine reduces resource losses by 1.2 times compared to SPEA2 and NSGA-II methods.
- 20 September 2023
- Published by National Technical University Kharkiv Polytechnic Institute in Advanced Information Systems
- Vol. 7 (3) , 67-73
ADAPTIVE RESOURCE ALLOCATION METHOD FOR DATA PROCESSING AND SECURITY IN CLOUD ENVIRONMENT
Subject of research: methods of resource allocation of the cloud environment. The purpose of the research: to develop a method of resource allocation that will improve the security of the cloud environment. At the same time, effective data processing should be achieved. Method characteristics. The article discusses the method of adaptive resource allocation in cloud environments, focusing on its significance for data processing and enhanced security. A notable feature of the method is the consideration of external influences when calculating the characteristics of cloud resource requests and predicting resource requests based on a time series test. The main idea of this approach lies in the ability to intelligently distribute resources while considering real needs, which has the potential to optimize both productivity and confidentiality protection simultaneously. Integrating adaptive resource allocation methods not only improves data processing efficiency in cloud environments but also strengthens mechanisms against potential cyber threats. Research results. To ensure timely resource allocation, the NSGA-II algorithm has been enhanced. This allowed reducing the resolution time of multi-objective optimization tasks by 5%. Additionally, research results demonstrate that effective utilization of various types of resources on a physical machine reduces resource losses by 1.2 times compared to SPEA2 and NSGA-II methods.