Igor B. Bourdonov
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Igor B. Bourdonov has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Alexander Sergeevitch Kossatchev
Ivannikov Institute for System Programming, Russian Academy of Sciences, Moscow, Russia
25 shared publications - Victor Viatcheslavovitch Kuliamin
Ivannikov Institute for System Programming, Russian Academy of Sciences, Moscow, Russia
10 shared publications - Alexander Konstantinovich Petrenko
Ivannikov Institute for System Programming, Russian Academy of Sciences, Moscow, Russia
5 shared publications - Natalia Kushik
Samovar, Télécom SudParis, Institut Polytechnique de Paris
3 shared publications - Nina Yevtushenko
Ivannikov Institute for System Programming of the Russian Academy of Sciences
3 shared publications N. V. Evtushenko
Ivannikov Institute for System Programming, Russian Academy of Sciences
2 shared publications
Latest Publications
- 22 August 2026
- Published by Pleiades Publishing Ltd in Programming and Computer Software
- Vol. 52 (4) , 308-317
CLOS Operating System Family
CLOS is a technology and family of embedded operating systems supporting multicore architectures, with enhanced safety (DO-178C) and secure software development lifecycle (SSDL) requirements. CLOS provides spatial (memory) and temporal (response time guarantees) isolation of functional and system software. RTOS overhead is minimized through static memory configuration and nonperiodic timers with quantization. This article briefly describes the history of work on operating systems based on the microkernel approach, which began under the leadership of Academician V.P. Ivannikov in the 1970s and the development they have undergone to date. The main architectural solutions used in CLOS versions developed at the Institute of System Programming of the Russian Academy of Sciences for aerospace systems over the past ten years are described in more detail.
- 22 August 2026
- Published by Pleiades Publishing Ltd in Programming and Computer Software
- Vol. 52 (4) , 308-317
CLOS Operating System Family
CLOS is a technology and family of embedded operating systems supporting multicore architectures, with enhanced safety (DO-178C) and secure software development lifecycle (SSDL) requirements. CLOS provides spatial (memory) and temporal (response time guarantees) isolation of functional and system software. RTOS overhead is minimized through static memory configuration and nonperiodic timers with quantization. This article briefly describes the history of work on operating systems based on the microkernel approach, which began under the leadership of Academician V.P. Ivannikov in the 1970s and the development they have undergone to date. The main architectural solutions used in CLOS versions developed at the Institute of System Programming of the Russian Academy of Sciences for aerospace systems over the past ten years are described in more detail.
- 15 July 2025
- Published by Pleiades Publishing Ltd in Programming and Computer Software
- Vol. 51 (4) , 224-241
Improving System Survivability by Path Duplication
In this paper, the problem of distributed network survivability is investigated. A distributed system is modeled by a finite connected undirected graph the nodes of which are divided into two types: hosts and switches. Hosts perform computational functions, while switches are used for message passing between hosts. The survivability of the system is understood as its ability to perform the main message passing functions after a failure of some graph edges. The solution to the problem of system survivability is provided by the duplication of message passing paths. The main condition for the correct solution is the absence of message looping in the network for any set of selected paths. A four-path theorem is proved for the case of one sender host and two receiver hosts: if, for each receiver host, there are two paths from a sender host and the sets of edges traversed by these paths are disjoint, then these paths can be selected in such a way that there is no message looping for this set of paths.
- 15 July 2025
- Published by Pleiades Publishing Ltd in Programming and Computer Software
- Vol. 51 (4) , 224-241
Improving System Survivability by Path Duplication
In this paper, the problem of distributed network survivability is investigated. A distributed system is modeled by a finite connected undirected graph the nodes of which are divided into two types: hosts and switches. Hosts perform computational functions, while switches are used for message passing between hosts. The survivability of the system is understood as its ability to perform the main message passing functions after a failure of some graph edges. The solution to the problem of system survivability is provided by the duplication of message passing paths. The main condition for the correct solution is the absence of message looping in the network for any set of selected paths. A four-path theorem is proved for the case of one sender host and two receiver hosts: if, for each receiver host, there are two paths from a sender host and the sets of edges traversed by these paths are disjoint, then these paths can be selected in such a way that there is no message looping for this set of paths.
- 15 June 2023
- Published by The Russian Academy of Sciences in Автоматика и телемеханика
- No. 6,p. 67-78
On Preset Homing and Synchronizing Sequences for Observable Input/Output Automata
The paper is devoted to the problem of deriving synchronizing and homing experiments for nondeterministic Input/Output automata; corresponding input sequences are widely used in testing (non-initialized) discrete event systems. In active testing, there is an opportunity to set a system under test into a known initial state; in passive testing, a known current state allows to reduce the number of properties to be checked. In the paper, we note that such experiments for Input/Output automata are different from so-called “gedanken” experiments with classical Finite State Machines; the existence check conditions of such experiments are established for a predefined discipline of applying inputs and a method for its derivation is proposed when such an experiment exists. The obtained results allow to reduce the problem of deriving synchronizing and homing experiments for Input/Output automata to the well developed problem of deriving such experiments for appropriate classes of Finite State Machines.
- 15 June 2023
- Published by The Russian Academy of Sciences in Автоматика и телемеханика
- No. 6,p. 67-78
On Preset Homing and Synchronizing Sequences for Observable Input/Output Automata
The paper is devoted to the problem of deriving synchronizing and homing experiments for nondeterministic Input/Output automata; corresponding input sequences are widely used in testing (non-initialized) discrete event systems. In active testing, there is an opportunity to set a system under test into a known initial state; in passive testing, a known current state allows to reduce the number of properties to be checked. In the paper, we note that such experiments for Input/Output automata are different from so-called “gedanken” experiments with classical Finite State Machines; the existence check conditions of such experiments are established for a predefined discipline of applying inputs and a method for its derivation is proposed when such an experiment exists. The obtained results allow to reduce the problem of deriving synchronizing and homing experiments for Input/Output automata to the well developed problem of deriving such experiments for appropriate classes of Finite State Machines.
- 1 June 2023
- Published by Pleiades Publishing Ltd in Automation and Remote Control
- Vol. 84 (6) , 606-611
On Preset Homing and Synchronizing Sequences for Observable Input/Output Automata
The paper is devoted to the problem of deriving synchronizing and homing experiments for nondeterministic Input/Output automata; corresponding input sequences are widely used in testing (non-initialized) discrete event systems. In active testing, there is an opportunity to set a system under test into a known initial state; in passive testing, a known current state allows to reduce the number of properties to be checked. In the paper, we note that such experiments for Input/Output automata are different from so-called “gedanken” experiments with classical Finite State Machines; the existence check conditions of such experiments are established for a predefined discipline of applying inputs and a method for its derivation is proposed when such an experiment exists. The obtained results allow to reduce the problem of deriving synchronizing and homing experiments for Input/Output automata to the well developed problem of deriving such experiments for appropriate classes of Finite State Machines.
- 1 June 2023
- Published by Pleiades Publishing Ltd in Automation and Remote Control
- Vol. 84 (6) , 606-611
On Preset Homing and Synchronizing Sequences for Observable Input/Output Automata
The paper is devoted to the problem of deriving synchronizing and homing experiments for nondeterministic Input/Output automata; corresponding input sequences are widely used in testing (non-initialized) discrete event systems. In active testing, there is an opportunity to set a system under test into a known initial state; in passive testing, a known current state allows to reduce the number of properties to be checked. In the paper, we note that such experiments for Input/Output automata are different from so-called “gedanken” experiments with classical Finite State Machines; the existence check conditions of such experiments are established for a predefined discipline of applying inputs and a method for its derivation is proposed when such an experiment exists. The obtained results allow to reduce the problem of deriving synchronizing and homing experiments for Input/Output automata to the well developed problem of deriving such experiments for appropriate classes of Finite State Machines.
- 3 December 2021
- Published by Pleiades Publishing Ltd in Programming and Computer Software
- Vol. 47 (7) , 505-514
Perfect Sets of Paths in the Full Graph of SDN Switches
This paper investigates the implementation of virtual networks on the SDN data plane modeled by a graph of physical connections between network nodes. A virtual network is defined as a set of ordered host pairs (sender and receiver) and is implemented by a set of host–host paths that uniquely determine the settings of switches. A set of paths is said to be perfect if any subset of its paths can be implemented loop-free, i.e., without endless movement of packets in a loop, without duplicate paths (when the host receives the same packet several times), and without unintended paths (when the host receives a packet directed to some other host). In the case where the switchgraph is a complete graph, sufficient conditions for the existence of the largest perfect set of paths connecting all pairs of different hosts are established. Algorithms for constructing this largest perfect set are proposed and their complexity is estimated. The paper also reports preliminary results of conducted computer experiments, which suggest that the proposed sufficient conditions are not necessary ones.
- 3 December 2021
- Published by Pleiades Publishing Ltd in Programming and Computer Software
- Vol. 47 (7) , 505-514
Perfect Sets of Paths in the Full Graph of SDN Switches
This paper investigates the implementation of virtual networks on the SDN data plane modeled by a graph of physical connections between network nodes. A virtual network is defined as a set of ordered host pairs (sender and receiver) and is implemented by a set of host–host paths that uniquely determine the settings of switches. A set of paths is said to be perfect if any subset of its paths can be implemented loop-free, i.e., without endless movement of packets in a loop, without duplicate paths (when the host receives the same packet several times), and without unintended paths (when the host receives a packet directed to some other host). In the case where the switchgraph is a complete graph, sufficient conditions for the existence of the largest perfect set of paths connecting all pairs of different hosts are established. Algorithms for constructing this largest perfect set are proposed and their complexity is estimated. The paper also reports preliminary results of conducted computer experiments, which suggest that the proposed sufficient conditions are not necessary ones.
- Open Access
- 1 December 2018
- Published by Allerton Press in Automatic Control and Computer Sciences
- Vol. 52 (7) , 589-595
Deriving Synchronizing and Homing Sequences for Input/Output Automata
The paper considers the problems of checking the existence and synthesis of synchronizing and homing sequences for finite input/output automata. The relevant sequences can be used when...
- 1 December 2018
- Published by Allerton Press in Automatic Control and Computer Sciences
- Vol. 52 (7) , 589-595
Open AccessDeriving Synchronizing and Homing Sequences for Input/Output Automata
The paper considers the problems of checking the existence and synthesis of synchronizing and homing sequences for finite input/output automata. The relevant sequences can be used when...
- 1 March 2017
- Published by Tomsk State University in Vestnik Tomskogo Gosudarstvennogo Universiteta. Upravlenie, Vychislitel'naya Tekhnika i Informatika
- No. 38,p. 63-71
Testing of automata system
- 1 March 2017
- Published by Tomsk State University in Vestnik Tomskogo Gosudarstvennogo Universiteta. Upravlenie, Vychislitel'naya Tekhnika i Informatika
- No. 38,p. 63-71
Testing of automata system
- 1 December 2016
- Published by Tomsk State University in Vestnik Tomskogo Gosudarstvennogo Universiteta. Upravlenie, Vychislitel'naya Tekhnika i Informatika
- No. 4(37),p. 89-97
Generalized model of automata system
- 1 December 2016
- Published by Tomsk State University in Vestnik Tomskogo Gosudarstvennogo Universiteta. Upravlenie, Vychislitel'naya Tekhnika i Informatika
- No. 4(37),p. 89-97
Generalized model of automata system
- 15 November 2015
- Published by Pleiades Publishing Ltd in Programming and Computer Software
- Vol. 41 (6) , 307-310
Analysis of a graph by a set of automata
An algorithm of traversal (retrieval of full information on the structure) of an a priori unknown directed graph by an unbounded set of finite automata that interact through the exchange of messages and can move along the arcs of the graph according to their direction is described. Under the assumption that the execution time of basic operations and the transmission time of individual messages are bounded, the total operating time of the algorithm is bounded, at worst, by O(m + nd), where n is the number of vertices of the graph, m is the number of its arcs, and d is the diameter of the graph; moreover, this estimate is unimprovable. The full proofs of the propositions formulated in this paper have been published in [6].
- 15 November 2015
- Published by Pleiades Publishing Ltd in Programming and Computer Software
- Vol. 41 (6) , 307-310
Analysis of a graph by a set of automata
An algorithm of traversal (retrieval of full information on the structure) of an a priori unknown directed graph by an unbounded set of finite automata that interact through the exchange of messages and can move along the arcs of the graph according to their direction is described. Under the assumption that the execution time of basic operations and the transmission time of individual messages are bounded, the total operating time of the algorithm is bounded, at worst, by O(m + nd), where n is the number of vertices of the graph, m is the number of its arcs, and d is the diameter of the graph; moreover, this estimate is unimprovable. The full proofs of the propositions formulated in this paper have been published in [6].
- 22 January 2015
- Published by Pleiades Publishing Ltd in Programming and Computer Software
- Vol. 41 (1) , 1-13
Parallel computations on a graph
- 22 January 2015
- Published by Pleiades Publishing Ltd in Programming and Computer Software
- Vol. 41 (1) , 1-13
Parallel computations on a graph