In the digital age, the role of information technology and computer processes is growing. This requires refining the development of software by optimizing the communications between program components and seeking effective interaction in the implementation of processes. Complex module structures are usually developed, which require high compatibility between components and their proper functioning. The purpose of this article is to propose an approach for investigation of a set of connected computer processes executed on a macro level by using deterministic modelling. A formal technological procedure for conducting a deterministic investigation of the interaction between processes was developed. It allows for the transition from the object-original to an adequate mathematical model with its program realization. The core of the constructed procedure is the phases “mathematical formalization”, “mathematical description”, and “program realization”. The goal was to present an application of the procedure to investigate all possible realizations of connected processes, presented as nodes in a directed graph scheme of algorithms by determining the reachability. The program language APL2 was used as a tool for program description of the defined mathematical models, which were realized in the software system TryAPL2 for research automation. A preliminary mathematical formalization of interacting processes was made by presenting an example graph scheme and its transformation into an ordered structure. On the basis of the mathematical description, we developed two program models for automation of the transition to an ordered graph scheme and determination of all possible paths in it for activation of sequences of processes. The proposed models are part of a generalized environment for program investigation of the computer processing organization.

中文翻译：

---

宏观一级计算机​​过程的数学建模和研究方法

在数字时代，信息技术和计算机过程的作用正在增长。这就需要通过优化程序组件之间的通信并在过程的实现中寻求有效的交互来完善软件的开发。通常开发复杂的模块结构，这要求组件之间的高度兼容性及其正常运行。本文的目的是提出一种方法，用于通过使用确定性建模来研究在宏级别执行的一组连接的计算机进程。开发了用于对过程之间的相互作用进行确定性研究的正式技术程序。它允许通过程序实现从原始对象到适当的数学模型的转换。所构建过程的核心是“数学形式化”，“数学描述”和“程序实现”两个阶段。目的是提出一种程序的应用程序，以研究连接过程的所有可能实现，并通过确定可达性将其表示为算法的有向图方案中的节点。程序语言APL2用作定义数学模型程序描述的工具，该工具在用于研究自动化的软件系统TryAPL2中实现。通过提供示例图方案并将其转换为有序结构，对交互过程进行了初步的数学形式化。根据数学描述，我们开发了两个程序模型，用于自动化过渡到有序图形方案并确定其中所有可能的路径以激活流程序列的程序模型。提出的模型是计算机处理组织程序研究的通用环境的一部分。