PROCESS ALGEBRA FOR SIMULATION OF COMPLEX DISCRETE SYSTEMS

Authors

  • M. A. Novotarsky Institute of Mathematics of the National Academy of Sciences of Ukraine, Kiev, Ukraine

DOI:

https://doi.org/10.15588/1607-3274-2007-2-16

Abstract

In the paper the process algebra as the tool for the formal description of complex discrete systems is submitted. The structure of sets on which variables and expressions of process algebra are determined is considered. Syntactic structures and semantic rules of performance of the operations allowing to set the formal description for simulations with real working load are described. For definition of adequacy of model it is offered to use the principles of equivalence  basing on congruence, strong and weak bisimilarity.

Author Biography

M. A. Novotarsky, Institute of Mathematics of the National Academy of Sciences of Ukraine, Kiev

Ph.D., Senior Researcher

References

Mіlner R. Calculus of Communіcatіng Systems // Lecture Notes іn Computer Sciences. – 1980. – Vol. 92. – P. 260.

Milner R. Communication and Concurrency. – Prentice Hall. – 1995. – P. 272.

Bergstra J. A., Middelburg C. A. Process algebra for hybrid systems // Theoretical Computer Science. – 2005. – Vol. 335, No. 2/3. – PP. 215–208.

Plotkin G. D. A Structured Approach to Operational Semantics. Technical Report DAIMI FM-19, Computer Science Department, Aarhus University. – 1981. – P. 133.

Published

2024-11-19

How to Cite

Novotarsky, M. A. (2024). PROCESS ALGEBRA FOR SIMULATION OF COMPLEX DISCRETE SYSTEMS. Radio Electronics, Computer Science, Control, (2), 79. https://doi.org/10.15588/1607-3274-2007-2-16

Issue

Section

Mathematical and computer modelling