Abstract
The paper considers the decomposition of process control algorithms for parallel computing systems using automata models. When designing parallel processing systems, an important problem is the formal representation of process control algorithms since they allow integrated solving the tasks of specification, development, implementation, verification, and analysis of complex control systems, including the control over interacting processes and resources in parallel computing systems. Formal techniques should more especially be applied in the verification of complex data processing systems by model testing.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call