Discrete Algorithmic Processes: Real Time, Parallelism, Complexity, and Languages
摘要
Abstract
Models and languages intended for describing and controlling the execution of discrete deterministic processes in real time are considered. The processes are divided into free and real-time dependent, and the characteristics of process complexity are introduced that take into account the factor of simultaneity (parallelism) during their execution. Unified operations for the composition of computable functions are proposed, based on which a language is created that allows the parallelism of algorithmic processes to be described in a natural form. It is shown how the real-time factor can be reflected in processes by extending the language with primitives for controlling changes in process states depending on the controlled time.