Zobrazeno 1 - 10
of 26
pro vyhledávání: '"S. V. Zelenov"'
Autor:
S. A. Zelenova, S. V. Zelenov
Publikováno v:
Труды Института системного программирования РАН, Vol 29, Iss 6, Pp 183-202 (2018)
В критических системах выполнение жестких требований по времени взаимодействия между задачами обеспечивается строгой периодичностью
Externí odkaz:
https://doaj.org/article/08627c61ce084551968afb5f41c6ac45
Autor:
S. V. Zelenov, S. A. Zelenova
Publikováno v:
Труды Института системного программирования РАН, Vol 29, Iss 5, Pp 257-282 (2018)
Hardware-software systems are widely used now and must be safe and reliable. Manual analysis of risks for structural complex systems is very expensive, so formal automated methods are required. The most important aspect here is the possibility to des
Externí odkaz:
https://doaj.org/article/a033bc6b806d4be7ae25494564c46ac1
Autor:
D. V. Buzdalov, S. V. Zelenov, E. V. Kornykhin, A. K. Petrenko, A. V. Strakh, A. A. Ugnenko, A. V. Khoroshilov
Publikováno v:
Труды Института системного программирования РАН, Vol 26, Iss 1, Pp 201-230 (2018)
Growth of modern avionics systems makes design of such systems impossible without involvement of automation. Nowadays an area of such tools is represented by both the proprietary tools developed by the major aircraft manufacturers like Boeing and Air
Externí odkaz:
https://doaj.org/article/efb74ee61157432b9349fa74d2bb50cc
Publikováno v:
Труды Института системного программирования РАН, Vol 30, Iss 3, Pp 99-120 (2018)
The analysis of models and methods of reliability evaluation of hardware and software is carried out. The basic concepts of reliability and safety methods of such systems and situations leading to errors, defects and failures are defined. The definit
Externí odkaz:
https://doaj.org/article/c248de8dd93949f886d651db8f384df4
Autor:
A. A. Karnov, S. V. Zelenov
Publikováno v:
Труды Института системного программирования РАН, Vol 29, Iss 4, Pp 191-202 (2018)
In this paper we consider Markov analysis of models of complex software and hardware systems. A Markov analysis tool can be used during verification processes of models of avionics systems. In the introduction we enumerate main advantages and disadva
Externí odkaz:
https://doaj.org/article/0c482cf68b8f4efc859839e59b6f023b
Autor:
S. V. Zelenov
Publikováno v:
Труды Института системного программирования РАН, Vol 20, Iss 0 (2018)
The very important subsystem in a real-time system is a task scheduler. Classical algorithms for periodic tasks scheduling imply that release points of each task may vary inside different periods of the task. However, nowadays, some systems require a
Externí odkaz:
https://doaj.org/article/947ce88d70da46f5983d8048521e9063
Autor:
S V Zelenov, A A Karnov
Publikováno v:
Труды Института системного программирования РАН, Vol 29, Iss 4, Pp 191-202 (2018)
In this paper we consider Markov analysis of models of complex software and hardware systems. A Markov analysis tool can be used during verification processes of models of avionics systems. In the introduction we enumerate main advantages and disadva
Autor:
S. V. Zelenov, S. A. Zelenova
Publikováno v:
Programming and Computer Software. 44:159-169
A new look at the problem of constructing a scheduler in the case of a group of strictly periodic tasks is proposed. The structure of the system of periods is represented in terms of graph theory. A criterion for the existence of a conflict-free sche
Autor:
S. A. Zelenova, S. V. Zelenov
Publikováno v:
Труды Института системного программирования РАН, Vol 29, Iss 5, Pp 257-282 (2018)
Hardware-software systems are widely used now and must be safe and reliable. Manual analysis of risks for structural complex systems is very expensive, so formal automated methods are required. The most important aspect here is the possibility to des
Autor:
S. A. Zelenova, S. V. Zelenov
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030374860
Ershov Informatics Conference
Ershov Informatics Conference
In the paper, we suggest new approach to schedulability problem for strict periodic tasks (a periodic task is strict if it must be started in equal intervals of time – task’s period). Given permissible tasks’ periods, our approach allows to obt
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4d0f481d6b422616fa9cd409675dac1a
https://doi.org/10.1007/978-3-030-37487-7_18
https://doi.org/10.1007/978-3-030-37487-7_18