B. B. Nesterenko, M. O. Novatorskyi


 In the paper principles of formal representation of discrete systems and their models are considered. Definitions of straightforward similarity, back similarity and bisimilarity between systems and their models are given. The structure of formal means and their evolution is briefly described. The new version of networks for modeling complex discrete systems with asynchronous interaction of components is offered.


tools for modeling; discrete systems; mutual similarity

GOST Style Citations

1. Бусленко Н. П., Калашников В. В., Коваленко И. Н. Лекции по теории сложных систем.– М.: Сов. радио, 1973.– 439 с.

2. Питерсон Дж. Теория сетей Петри и моделирование систем.– М.: Мир, 1984.– 264 с.

3. Котов В.Е. Сети Петри.– М.: Наука, 1984.– 160 с.

4. Jensen K. Coloured Petri Nets // Lecture Notes in Computer Science.– 1987.– vol.254.– P.248-299.

5. Nutt G.J. Evaluation nets for computer system performance analysis // 1972 Fall Joint Computer Conference, AFIPS Conference Proceedings. – 1973. – vol.41. – P.279-286.

6. Нестеренко Б.Б., Новотарский М.А. Мультипроцессорные системы.– Киев: Институт математики, 1995.– 408 с.

7. Boesh F.T., Wang J. Reliable circulant networks with minimum transmission delay // IEEE Trans. Cir. And Sys.– 1984.– CAS-32.– P.1286-1291.

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.


ISSN 2307–3489 (Print)
ІSSN 2307–6666 (Online)