|
||||||||||
|
V. P. Kulagin, D. Sc., Professor, Head of the Department "Hardware, software and mathematical support of computer systems", e-mail: Kulagin_VP@mgupi.ru, E. S. Malych, Master Student of the Department "Hardware, software and mathematical support of computer systems"; e-mail: katya.miller.95@yandex.ru, MIREA-Russian University of Technology, Moscow Design of Matrix Computing Structures using Petri Nets In article on the example of projection of matrix computing structures the synthesis algorithm of the simulativing Petri nets is offered. Approach to synthesis of new structures on the basis of use of vectors of a projection is described. It is shown that this approach doesn't allow to receive all set of the possible Petri nets modeling realization of the function set on matrix structure. The original algorithm of projection of the complete set of the possible joint ventures models of matrix structures for the given function is described. The algorithm is based on use of a structure analysis and tensor methodology. Oscillation of programs of synthesis of structures of the joint venture models is result of work of an algorithm. It is shown that among the generated programs exist such which synthesize the equivalent joint ventures models. The properties revealing the "equivalent" programs are formulated. For the purpose of the quantitative and qualitative analysis of the constructed matrix structures criteria for evaluation of structural and dynamic properties of the synthesizable joint ventures models are injected. It is shown that owing to exponential body height of number of the synthesizable joint ventures models from dimension of an initial primitive system, searching of new receptions and approaches which would exclude from consideration of model is necessary, not meeting beforehand the given requirements. P. 271–283 |