Abstract

This article emphasizes the effectiveness and relevance of the using of the apparatus of Petri nets for modeling of complex computing systems. Due to the fact that the methods of analysis existing in this theory do not allow estimating the resources required to build the desired model of the system, there is a problem of shortage of criteria for its evaluation in terms of the complexity of the construction. In the article we consider the method of analysis of a random Petri net based on the complexity of its building and relationships of internal units - subnets. The purpose of this article is a software implementation of such an assessment within the theory of PN structures. Due to the fact, that structural approach allows to perform the operation of decomposition of the original system, this model can be divided into subnets of minimal dimension, that will allow to make its quantitative assessment - ranking. To determine the total assessment of the input and output data of the system we will perform the analysis of head and tail positions of the net taking into account the weights of the input and output arcs of these positions. In order to identify an extent of the cost required to build the system, the number of operations of union of subnet transitions and positions. These subnets have minimal dimension in the original PN. Thus, the article demonstrates the formal implementation of assessment technique modules with using of algebra of sets, and the rules of splitting the PN structure into elementary blocks are formulated. The example of a comparative assessment of the two Petri nets based on the proposed complexity criteria is given; the plots of PN in different coordinate systems are displayed. The article presents the results of the research - a plot of PN structures in three-dimensional space, implemented using described software. It demonstrates the accuracy of PN assessment by structural analysis in comparing with a non-automated visual one. This approach can be applied for comparative assessment of computer systems in terms of complexity of their construction and size of input and output data.

Highlights

  • The development of modern information technology has already determined the effectiveness of the application of mathematical abstractions in order to identify the properties and behavioral states of complex computing systems

  • The theories of graphs [1, 2], finite automata [3], as well as the apparatus of Petri nets may be the tools of such research

  • The article will consider the apparatus of Petri nets which has a powerful formal expressiveness in describing and modelling of computing systems

Read more

Summary

Introduction

The development of modern information technology has already determined the effectiveness of the application of mathematical abstractions in order to identify the properties and behavioral states of complex computing systems. The theories of graphs [1, 2], finite automata [3], as well as the apparatus of Petri nets may be the tools of such research. The article will consider the apparatus of Petri nets which has a powerful formal expressiveness in describing and modelling of computing systems. The inhibitory nets [6, 7] are used in order to ensure the protection and security of information system, hierarchical ones [8] are to perform the analysis of complex dynamic systems containing embedded nets, scholastic ones [9] are used when it is necessary to provide the random length of the trigging of net transitions. It should be noted that the reduction is a complementary research tool and it is a special case of equivalent transformations, reducing the dimension of the net [10]

Statement of the problem
The formal implementation
Calculating
The characteristic of system
Scale 1
Scale 2
Scale 3
Conclusion
Full Text
Published version (Free)

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