Topology properties of the designing process
Mathematics
Аuthors
,Moscow Aviation Institute (National Research University), 4, Volokolamskoe shosse, Moscow, А-80, GSP-3, 125993, Russia
Abstract
The aim of the article is to investigate mathematical properties of the designing process. Problems, covered in the item, are famous for modeling, when we engaged in the automation of the designing process. It is proved that the designing process is closed, bounded and connected metric domain. It is proved that the designing process as the mathematical object represents the directed progressive- bounded graph. It is proved that for providing connectedness the graph may be enlarged with some elements of the designing process, and it is defined with which elements exactly the graph may be enlarged. It is proved that ordering relationship on the sets of both edges and vertexes of the graph couldn-t be independent. The topological invariants of the designing process are defined.Download