<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE root>
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" article-type="research-article" dtd-version="1.2" xml:lang="en"><front><journal-meta><journal-id journal-id-type="publisher-id">RUDN Journal of Engineering Research</journal-id><journal-title-group><journal-title xml:lang="en">RUDN Journal of Engineering Research</journal-title><trans-title-group xml:lang="ru"><trans-title>Вестник Российского университета дружбы народов. Серия: Инженерные исследования</trans-title></trans-title-group></journal-title-group><issn publication-format="print">2312-8143</issn><issn publication-format="electronic">2312-8151</issn><publisher><publisher-name xml:lang="en">Peoples’ Friendship University of Russia named after Patrice Lumumba (RUDN University)</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">30294</article-id><article-id pub-id-type="doi">10.22363/2312-8143-2021-22-3-270-282</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>Articles</subject></subj-group><subj-group subj-group-type="toc-heading" xml:lang="ru"><subject>Статьи</subject></subj-group><subj-group subj-group-type="article-type"><subject>Research Article</subject></subj-group></article-categories><title-group><article-title xml:lang="en">Argumentation of introducing a discrete-continuous topology in the interests of algorithmization of complex functioning processes</article-title><trans-title-group xml:lang="ru"><trans-title>Обоснование введения дискретно-непрерывной топологии в интересах алгоритмизации сложных процессов функционирования</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0003-0116-5889</contrib-id><name-alternatives><name xml:lang="en"><surname>Malinina</surname><given-names>Natalia L.</given-names></name><name xml:lang="ru"><surname>Малинина</surname><given-names>Наталия Леонидовна</given-names></name></name-alternatives><bio xml:lang="en"><p>Candidate of Physical and Mathematical Sciences, Associate Professor of the Department 604, Aerospace Faculty</p></bio><bio xml:lang="ru"><p>кандидат физико-математических наук, доцент кафедры 604, Аэрокосмический факультет</p></bio><email>malinina806@gmail.com</email><xref ref-type="aff" rid="aff1"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">Moscow Aviation Institute (National Research University)</institution></aff><aff><institution xml:lang="ru">Московский авиационный институт (национальный исследовательский университет)</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2021-12-30" publication-format="electronic"><day>30</day><month>12</month><year>2021</year></pub-date><volume>22</volume><issue>3</issue><issue-title xml:lang="en">VOL 22, NO3 (2021)</issue-title><issue-title xml:lang="ru">ТОМ 22, №3 (2021)</issue-title><fpage>270</fpage><lpage>282</lpage><history><date date-type="received" iso-8601-date="2022-02-24"><day>24</day><month>02</month><year>2022</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2021, Malinina N.L.</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2021, Малинина Н.Л.</copyright-statement><copyright-year>2021</copyright-year><copyright-holder xml:lang="en">Malinina N.L.</copyright-holder><copyright-holder xml:lang="ru">Малинина Н.Л.</copyright-holder><ali:free_to_read xmlns:ali="http://www.niso.org/schemas/ali/1.0/"/><license><ali:license_ref xmlns:ali="http://www.niso.org/schemas/ali/1.0/">http://creativecommons.org/licenses/by/4.0</ali:license_ref></license></permissions><self-uri xlink:href="https://journals.rudn.ru/engineering-researches/article/view/30294">https://journals.rudn.ru/engineering-researches/article/view/30294</self-uri><abstract xml:lang="en"><p style="text-align: justify;">The main aim of the research is to show and prove the necessity of introducing a new, discrete-continuous topological structure to describe complicated systems and processes of their functioning. Currently, there are two topological structures: continuous and discrete. At the same time, there are functional approaches in order to describe complicated systems and processes of their functioning, based on continuous topology. Until now, it has not been possible to build full functionality for the design of complicated technical objects. Therefore, the functional approach does not fully correspond to the increasingly complicated tasks of our time. The introduction of discrete-continuous topology is especially important for the exploring and modeling of complicated systems and processes of their functioning. In order to prove this fact, the present study describes the properties of complicated processes using examples of the flight process and the design process. The examination of these processes, as the most complicated, proves that the complicated systems and processes are topological spaces with metric, so they can be represented in the form of an oriented progressively bounded graph. Also, it proves the topological invariants of complicated systems and the processes of functioning. Presentation of the complicated processes in the form of a directed graph allows getting shorter path to their algorithmicization and programming, which is necessary for existing practice. In addition, the presentation of a complicated process as a directed graph will allow using the apparatus of graph theory for such purpose and will significantly expand the capabilities of programmers.</p></abstract><trans-abstract xml:lang="ru"><p style="text-align: justify;">Цель исследования - показать и доказать необходимость введения новой, дискретно-непрерывной топологической структуры для описания сложных систем и процессов их функционирования. В настоящее время существуют две топологические структуры: непрерывная и дискретная. Также имеются функциональные подходы к описанию сложных систем и процессов их функционирования, основанные на непрерывной топологии. До сих пор не удалось построить полный функционал для систем проектирования сложных технических объектов, по этой причине функциональный подход не в полной мере соответствуют усложняющимся задачам современности. И поэтому введение дискретно-непрерывной топологии важно для исследования и моделирования сложных систем и процессов функционирования. В качестве доказательства описываются свойства сложных процессов на примерах процесса полета и процесса проектирования. Изучение этих процессов как самых сложных показывает, что они, при условии введения новой дискретно-непрерывной топологии, могут быть представлены в виде ориентированного графа. Обосновываются топологические инварианты сложных систем и процессов функционирования. Представление сложных процессов в виде ориентированного графа позволяет более основательно перейти к их алгоритмизации и программированию, что необходимо для существующей практики. Кроме того, представление сложного процесса как ориентированного графа позволит применить для этих целей аппарат теории графов, что позволит значительно расширить возможности программистов.</p></trans-abstract><kwd-group xml:lang="en"><kwd>complicated process</kwd><kwd>discrete-continuous topology</kwd><kwd>model</kwd><kwd>graph theory</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>сложный процесс</kwd><kwd>дискретно-непрерывная топология</kwd><kwd>модель</kwd><kwd>теория графов</kwd></kwd-group><funding-group/></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><citation-alternatives><mixed-citation xml:lang="en">Kelley DL. General topology. New York, Toronto, London: D. van Nostrand Company, Inc.; 1955.</mixed-citation><mixed-citation xml:lang="ru">Kelley D.L. General topology. New York, Toronto, London: D. van Nostrand Company, Inc., 1955. 298 p.</mixed-citation></citation-alternatives></ref><ref id="B2"><label>2.</label><citation-alternatives><mixed-citation xml:lang="en">Kuratovski K, Mostovski A. Set theory. Amsterdam, Warsaw: North-Holland Publishing Company; 1968.</mixed-citation><mixed-citation xml:lang="ru">Куратовский К., Мостовский А. Топология. М.: Мир, 1970. 416 с.</mixed-citation></citation-alternatives></ref><ref id="B3"><label>3.</label><citation-alternatives><mixed-citation xml:lang="en">Viro OYa, Ivanov OA, Netsvetaev NYu, Kharlamov VM. Elementary topology. Problem textbook. AMS; 2008.</mixed-citation><mixed-citation xml:lang="ru">Viro O.Ya., Ivanov O.A., Netsvetaev N.Yu., Kharlamov V.M. Elementary topology. Problem textbook. AMS, 2008. 400 p.</mixed-citation></citation-alternatives></ref><ref id="B4"><label>4.</label><citation-alternatives><mixed-citation xml:lang="en">Korukhov VV. The model of discrete-continuous space-time and motion paradoxes “Achilles” and “Dichotomy.” Philosophy of Sciences. 2001;(2(10)):4. (In Russ.)</mixed-citation><mixed-citation xml:lang="ru">Корухов В.В. Модель дискретно-непрерывного пространства-времени // Философия науки. 2001. № 2 (10). С. 4.</mixed-citation></citation-alternatives></ref><ref id="B5"><label>5.</label><citation-alternatives><mixed-citation xml:lang="en">Korukhov VV, Sharipov ОV. The structure of space-time and the physical vacuum problem: modern status and future trends. Philosophy of Sciences. 2006;(1(28)): 20–36. (In Russ.)</mixed-citation><mixed-citation xml:lang="ru">Корухов В.В., Шарыпов О.В. Структура пространства-времени и проблема физического вакуума: состояние и перспективы // Философия науки. 2006. № 1 (28). С. 20-36.</mixed-citation></citation-alternatives></ref><ref id="B6"><label>6.</label><citation-alternatives><mixed-citation xml:lang="en">Chorafas DN. Systems and simulation. 1st ed. Academic Press; 1965.</mixed-citation><mixed-citation xml:lang="ru">Chorafas D.N. Systems and simulation. 1st ed. Academic Press, 1965. 503 p.</mixed-citation></citation-alternatives></ref><ref id="B7"><label>7.</label><citation-alternatives><mixed-citation xml:lang="en">Quade ES. Analysis for military decisions. Santa Monica: RAND Corporation, 1964.</mixed-citation><mixed-citation xml:lang="ru">Quade E.S. Analysis for military decisions. Santa Monica: RAND Corporation, 1964. 389 p.</mixed-citation></citation-alternatives></ref><ref id="B8"><label>8.</label><citation-alternatives><mixed-citation xml:lang="en">Malinina NL. Mathematical aspects of the design process. Applied geometry, engineering graphics, computer design. 2006;(3(5)):12–18.</mixed-citation><mixed-citation xml:lang="ru">Малинина Н.Л. Математические аспекты процесса проектирования // Прикладная геометрия, инженерная графика, компьютерный дизайн. 2006. № 3 (5). С. 12-18.</mixed-citation></citation-alternatives></ref><ref id="B9"><label>9.</label><citation-alternatives><mixed-citation xml:lang="en">Hill PH. The science of engeneering design. New York: Tufts University, Holt, Rinehart and Winston, Inc.; 1970.</mixed-citation><mixed-citation xml:lang="ru">Hill P.H. The science of engeneering design. New York: Tufts University; Holt, Rinehart and Winston, Inc., 1970. 264 p.</mixed-citation></citation-alternatives></ref><ref id="B10"><label>10.</label><citation-alternatives><mixed-citation xml:lang="en">Moiseev N. Mathematics sets up an experiment. Moscow: Nauka Publ.; 1979. (In Russ.)</mixed-citation><mixed-citation xml:lang="ru">Моисеев Н. Математика ставит эксперимент. М.: Наука, 1979. 223 с.</mixed-citation></citation-alternatives></ref><ref id="B11"><label>11.</label><citation-alternatives><mixed-citation xml:lang="en">Malinina NL, Malinin LI. Topological properties of the design process. Trudy MAI. 2008;(30):3. (In Russ.)</mixed-citation><mixed-citation xml:lang="ru">Малинина Н.Л., Малинин Л.И. Топологические свойства процесса проектирования // Труды МАИ. 2008. № 30. С. 3.</mixed-citation></citation-alternatives></ref><ref id="B12"><label>12.</label><citation-alternatives><mixed-citation xml:lang="en">Malinin LI, Malinina NL. Graph isomorphism in theorems and algorithms. Moscow: URSS Publ.; 2009. (In Russ.)</mixed-citation><mixed-citation xml:lang="ru">Малинин Л.И., Малинина Н.Л. Изоморфизм графов в теоремах и алгоритмах. М.: URSS, 2009. 249 c.</mixed-citation></citation-alternatives></ref><ref id="B13"><label>13.</label><citation-alternatives><mixed-citation xml:lang="en">Berge C. The theory of graphs and its applications. London: Methuen; New York: Wiley; 1962.</mixed-citation><mixed-citation xml:lang="ru">Berge C. The theory of graphs and its applications. London: Methuen; New York: Wiley, 1962. 247 p.</mixed-citation></citation-alternatives></ref><ref id="B14"><label>14.</label><citation-alternatives><mixed-citation xml:lang="en">Ore О. Theory of graphs. Providence: American Mathematical Society; 1962.</mixed-citation><mixed-citation xml:lang="ru">Ore О. Theory of graphs. Providence: American Mathematical Society, 1962. 270 p.</mixed-citation></citation-alternatives></ref><ref id="B15"><label>15.</label><citation-alternatives><mixed-citation xml:lang="en">Chinn WG, Steenrod NE. First concepts of topology: the geometry of mappings of segments, curves, circles, and disks. Washington: Mathematical Association of America; 1966. https://doi.org/10.5948/UPO9780883859339</mixed-citation><mixed-citation xml:lang="ru">Chinn W.G., Steenrod N.E. First concepts of topology: the geometry of mappings of segments, curves, circles, and disks. Washington: Mathematical Association of America, 1966. https://doi.org/10.5948/UPO9780883859339</mixed-citation></citation-alternatives></ref><ref id="B16"><label>16.</label><citation-alternatives><mixed-citation xml:lang="en">Markov AA, Nagorny NM. Theory of algorithms. Dordrecht, Boston, London: Kluwer Academic Publishers, 1988.</mixed-citation><mixed-citation xml:lang="ru">Марков А.А., Нагорный Н.М. Теория алгоритмов. М.: Наука, 1984. 282 с.</mixed-citation></citation-alternatives></ref></ref-list></back></article>
