Grygoriy Zholtkevych
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Grygoriy Zholtkevych has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Konstantin V. Nosov
V. N. Karazin Kharkiv National University
3 shared publications - Oleksandr Deineha
V. N. Karazin Kharkiv National University
3 shared publications - Volodymyr Donets
V. N. Karazin Kharkiv National University
3 shared publications - Artem Panchenko
V. N. Karazin Kharkiv National University
2 shared publications E. V. Vysotskaya
Kharkiv National University of Radio Electronics, Nauky ave., 14, Kharkiv, 61166, Ukraine
2 shared publications- Hassan Khalil El Zein
V.N. Karazin Kharkiv National University
2 shared publications
Latest Publications
- 7 February 2026
- Published by Academy of Cognitive and Natural Sciences
- p. 216-226
Selecting a Simulation Runtime for Opinion Dynamics: Evaluating Elixir for Agent-Based Models
We evaluate Elixir as a simulation runtime for opinion dynamics by implementing the same extended pairwise dialogue model in three engines with RNG parity: an Elixir actor engine, an Elixir task engine, and a Python multiprocessing baseline, ensuring identical outputs given the same seed. On a dense all-pairs stress test (𝑁 =300, 𝑇 =100, ∼4.5M dialogues), the actor engine was fastest; under a sparse random-matching topology (𝑘=8; 120k dialogues) the task engine outperformed actor by ≈18%. Both Elixir engines consistently exceeded Python. Ten repeated trials produced tight 95% confidence intervals, confirming stability and efficient multicore utilization on BEAM. We conclude that Elixir is a robust choice for high-concurrency agent-based simulations, with topology guiding engine selection (actor for dense, task for sparse). This runtime decision provides the methodological foundation for our subsequent modeling work.
- 7 February 2026
- Published by Academy of Cognitive and Natural Sciences
- p. 216-226
Selecting a Simulation Runtime for Opinion Dynamics: Evaluating Elixir for Agent-Based Models
We evaluate Elixir as a simulation runtime for opinion dynamics by implementing the same extended pairwise dialogue model in three engines with RNG parity: an Elixir actor engine, an Elixir task engine, and a Python multiprocessing baseline, ensuring identical outputs given the same seed. On a dense all-pairs stress test (𝑁 =300, 𝑇 =100, ∼4.5M dialogues), the actor engine was fastest; under a sparse random-matching topology (𝑘=8; 120k dialogues) the task engine outperformed actor by ≈18%. Both Elixir engines consistently exceeded Python. Ten repeated trials produced tight 95% confidence intervals, confirming stability and efficient multicore utilization on BEAM. We conclude that Elixir is a robust choice for high-concurrency agent-based simulations, with topology guiding engine selection (actor for dense, task for sparse). This runtime decision provides the methodological foundation for our subsequent modeling work.
- 1 January 2025
- Published by V.M. Glushkov Institute of Cybernetics in Kibernetyka ta Systemnyi Analiz
- p. 15-26
REALIZABILITY OF EVENT DIAGRAMS AND EXISTENCE OF LOGICAL CLOCKS
This paper addresses the problem of the relationship between the correctness of the event diagram of distributed computing from the standpoint of communication between local processes of this computing and the existence of a logical clock for that diagram. The problem is analyzed using The Coq Proof Assistant software without assuming the fairness of the principle of excluded middle. That is, the obtained results are correct from the point of view of constructive logic, which is essential for computer science. It has been formally proved that the existence of a logical clock for distributed computing ensures the irreflexivity of the causal relation related to that computing. The conjecture about the fairness of the converse statement has been claimed. Keywords: distributed computing, cloud platform, blockchain, digital distributed ledgers, global time, logical clock, event ordering.
- 1 January 2025
- Published by V.M. Glushkov Institute of Cybernetics in Kibernetyka ta Systemnyi Analiz
- p. 15-26
REALIZABILITY OF EVENT DIAGRAMS AND EXISTENCE OF LOGICAL CLOCKS
This paper addresses the problem of the relationship between the correctness of the event diagram of distributed computing from the standpoint of communication between local processes of this computing and the existence of a logical clock for that diagram. The problem is analyzed using The Coq Proof Assistant software without assuming the fairness of the principle of excluded middle. That is, the obtained results are correct from the point of view of constructive logic, which is essential for computer science. It has been formally proved that the existence of a logical clock for distributed computing ensures the irreflexivity of the causal relation related to that computing. The conjecture about the fairness of the converse statement has been claimed. Keywords: distributed computing, cloud platform, blockchain, digital distributed ledgers, global time, logical clock, event ordering.
- Open Access
- 28 June 2024
- Published by Private Company Technology Center in Eastern-European Journal of Enterprise Technologies
- Vol. 3 (2 (129)) , 42-54
The approach development of data extraction from lambda terms
The study's object is the process of extracting the characteristics of lambda terms, which indicate the optimality of the reduction strategy and increase the productivity of compilers and interpreters. The solution to the problem of extracting specific strategy priority data from lambda terms using Machine Learning methods was considered. Such data was extracted using the large language model Microsoft CodeBERT, which was trained to solve the problem of summarizing the software code. The resulting matrices of embeddings were used to obtain vectors of average embeddings of size 768 and a latent space of size 8 thousand. Further, vectors of average embeddings were used for cluster analysis using the DBSCAN and Hierarchical Agglomerative clustering methods. The most informative variables affecting clustering were determined. Next, the clustering results were compared with the priorities of reduction strategies, which showed the impossibility of separating terms with RI priority. A feature of the obtained results is using machine learning methods to obtain knowledge. The clustering results showed many of the same informative variables, which is explained by the similar shape of the obtained clusters. The results of comparing the clustering values with the real priority are explained by the impossibility of clearly determining the priority and the use of the Microsoft CodeBERT model, which was not trained for the analysis of lambda terms. The proposed approach can find application in the development of compilers and interpreters of functional programming languages, allowing to analyze the code and extract important data to optimize the execution of programs. The obtained data can be used to develop rules aimed at improving the efficiency of compilation and interpretation
- 28 June 2024
- Published by Private Company Technology Center in Eastern-European Journal of Enterprise Technologies
- Vol. 3 (2 (129)) , 42-54
Open AccessThe approach development of data extraction from lambda terms
The study's object is the process of extracting the characteristics of lambda terms, which indicate the optimality of the reduction strategy and increase the productivity of compilers and interpreters. The solution to the problem of extracting specific strategy priority data from lambda terms using Machine Learning methods was considered. Such data was extracted using the large language model Microsoft CodeBERT, which was trained to solve the problem of summarizing the software code. The resulting matrices of embeddings were used to obtain vectors of average embeddings of size 768 and a latent space of size 8 thousand. Further, vectors of average embeddings were used for cluster analysis using the DBSCAN and Hierarchical Agglomerative clustering methods. The most informative variables affecting clustering were determined. Next, the clustering results were compared with the priorities of reduction strategies, which showed the impossibility of separating terms with RI priority. A feature of the obtained results is using machine learning methods to obtain knowledge. The clustering results showed many of the same informative variables, which is explained by the similar shape of the obtained clusters. The results of comparing the clustering values with the real priority are explained by the impossibility of clearly determining the priority and the use of the Microsoft CodeBERT model, which was not trained for the analysis of lambda terms. The proposed approach can find application in the development of compilers and interpreters of functional programming languages, allowing to analyze the code and extract important data to optimize the execution of programs. The obtained data can be used to develop rules aimed at improving the efficiency of compilation and interpretation
- 1 December 2023
- Published by Springer Nature
- p. 25-38
On Randomization of Reduction Strategies for Typeless Lambda Calculus
- 1 December 2023
- Published by Springer Nature
- p. 25-38
On Randomization of Reduction Strategies for Typeless Lambda Calculus
- 18 November 2022
- Published by Springer Nature
- p. 3-22
An Approach to Construct Final Random System with Output
- 18 November 2022
- Published by Springer Nature
- p. 3-22
An Approach to Construct Final Random System with Output
- 22 January 2022
- Published by Academy of Cognitive and Natural Sciences
Estimating Lambda-Term Reduction Complexity with Regression Methods
In this study, we dive deep into the Pure Lambda Calculus' evaluation process, specifically zooming in on term reduction steps. Commonly, these steps are seen as the same, but our research suggests otherwise - some steps are more complex than others. We investigated how specific term features play a role in computing efficiency, aiming to shed light on how different reduction strategies perform. Through testing, our Linear Regression and ANN regression models showed potential in predicting the time taken for a reduction step based on term details. Yet, when we used richer datasets to pin down complexity, our predictions didn't sharpen as much as hoped. This leads us to believe that term details, while useful, might not be the full puzzle pieces we need for spot-on strategy predictions. This research opens the door for further exploration into refining our models and unearthing other crucial factors that could shape term reduction time. Ultimately, our findings could help optimize programming tools like compilers and interpreters, steering them toward swifter operations.
- 22 January 2022
- Published by Academy of Cognitive and Natural Sciences
Estimating Lambda-Term Reduction Complexity with Regression Methods
In this study, we dive deep into the Pure Lambda Calculus' evaluation process, specifically zooming in on term reduction steps. Commonly, these steps are seen as the same, but our research suggests otherwise - some steps are more complex than others. We investigated how specific term features play a role in computing efficiency, aiming to shed light on how different reduction strategies perform. Through testing, our Linear Regression and ANN regression models showed potential in predicting the time taken for a reduction step based on term details. Yet, when we used richer datasets to pin down complexity, our predictions didn't sharpen as much as hoped. This leads us to believe that term details, while useful, might not be the full puzzle pieces we need for spot-on strategy predictions. This research opens the door for further exploration into refining our models and unearthing other crucial factors that could shape term reduction time. Ultimately, our findings could help optimize programming tools like compilers and interpreters, steering them toward swifter operations.
- 19 November 2021
- Published by Academy of Cognitive and Natural Sciences
Coalgebraic Understanding of Random Systems with Output
The safety concept for clock constraints has already been coalgebraically studied for fully determin- istic cyber-physical systems (CPS). However, the corresponding control systems, as a rule, cannot be implemented in practice. There are many reasons for this, and the main one is the inability to collect accurate information about the state of the system in real time. In this article, the theory of determin- istic systems is generalised to the case of stochastic systems. The key tool for this generalisation is the use of the distribution monad. The advantage of the proposed approach is that it ensures that the previously proposed structure can be implemented in real-time systems, the behaviour of which could not be otherwise specified based on a purely deterministic approach.
- 19 November 2021
- Published by Academy of Cognitive and Natural Sciences
Coalgebraic Understanding of Random Systems with Output
The safety concept for clock constraints has already been coalgebraically studied for fully determin- istic cyber-physical systems (CPS). However, the corresponding control systems, as a rule, cannot be implemented in practice. There are many reasons for this, and the main one is the inability to collect accurate information about the state of the system in real time. In this article, the theory of determin- istic systems is generalised to the case of stochastic systems. The key tool for this generalisation is the use of the distribution monad. The advantage of the proposed approach is that it ensures that the previously proposed structure can be implemented in real-time systems, the behaviour of which could not be otherwise specified based on a purely deterministic approach.
- 22 May 2021
- Published by Springer Nature
- p. 141-165
Coalgebraic Approach to Studying Discrete Systems with Output
- 22 May 2021
- Published by Springer Nature
- p. 141-165
Coalgebraic Approach to Studying Discrete Systems with Output
- Open Access
- 28 December 2020
- Published by V. N. Karazin Kharkiv National University in Bulletin of V.N. Karazin Kharkiv National University, series «Mathematical modeling. Information technology. Automated control systems»
- Vol. 48 (48) , 72-80
Descriptive models of the determined systems
Common mathematical models of complex systems are not flexible, their creation is very resource-demanding and they are hard to work with. The numerous problems can arise during the process of building a mathematical model for complex systems. An area of knowledge, facts, and information could be structured badly or not structured at all. Part of the data might be missing or vice versa – we might have too much data available, which makes it difficult to find the necessary information. Therefore building a formal mathematical model, studying its dynamic for the relevant area of knowledge becomes a very hard or even almost impossible task. And that is why the new methods for such task are in much demand, namely, the methods of building descriptive mathematical models. The descriptive mathematical model serves as not a strict and formal model but a qualitative one. Such a qualitative model gives us a possibility to describe the character of the system, behavior of its internal components, and approximate rules of its dynamics. The qualitative model gives us a chance to deny the propositions, which do not fit the model directly at the first stage.
- 28 December 2020
- Published by V. N. Karazin Kharkiv National University in Bulletin of V.N. Karazin Kharkiv National University, series «Mathematical modeling. Information technology. Automated control systems»
- Vol. 48 (48) , 72-80
Open AccessDescriptive models of the determined systems
Common mathematical models of complex systems are not flexible, their creation is very resource-demanding and they are hard to work with. The numerous problems can arise during the process of building a mathematical model for complex systems. An area of knowledge, facts, and information could be structured badly or not structured at all. Part of the data might be missing or vice versa – we might have too much data available, which makes it difficult to find the necessary information. Therefore building a formal mathematical model, studying its dynamic for the relevant area of knowledge becomes a very hard or even almost impossible task. And that is why the new methods for such task are in much demand, namely, the methods of building descriptive mathematical models. The descriptive mathematical model serves as not a strict and formal model but a qualitative one. Such a qualitative model gives us a possibility to describe the character of the system, behavior of its internal components, and approximate rules of its dynamics. The qualitative model gives us a chance to deny the propositions, which do not fit the model directly at the first stage.
- Open Access
Understanding Safety Constraints Coalgebraically
Safety constraints are crucial to the development of mission-critical systems. The practice of developing software for systems of this type requires reliable methods for identifying and analysing project artefacts. This paper proposes a coalgebraic approach to understanding behavioural constraints for systems of a kind. The advantage of the proposed approach is that it gives a framework for providing abstract semantic models of the domain-specific languages designed for specifying behavioural constraints.
Open AccessUnderstanding Safety Constraints Coalgebraically
Safety constraints are crucial to the development of mission-critical systems. The practice of developing software for systems of this type requires reliable methods for identifying and analysing project artefacts. This paper proposes a coalgebraic approach to understanding behavioural constraints for systems of a kind. The advantage of the proposed approach is that it gives a framework for providing abstract semantic models of the domain-specific languages designed for specifying behavioural constraints.