• A
  • A
  • A
  • АБB
  • АБB
  • АБB
  • А
  • А
  • А
  • А
  • А
Обычная версия сайта
Найдены 22 публикации
Сортировка:
по названию
по году
Статья
Smeliansky R., Chemeritsky E., Zakharov V. Automatic Control and Computer Sciences. 2014. Vol. 48. No. 7. P. 398-406.
Добавлено: 30 сентября 2015
Статья
Baranov A., Baranov P. Automatic Control and Computer Sciences. 2016. Vol. 50. No. 8. P. 765-772.

The authors of [1, 2] suggested a model of information distortion by white noise. The present work discusses the asymptotic behavior of CRC error probabilities at low values of p, which is the probability of distortion of transferred information bits. On the basis of the theoretical results in two specific protocols—Е1 and ETSI EN 302307—as well as in the examples, the probability values for the error in recognizing the given packet as nondistorted in the presence of at least one distortion are assessed.

Добавлено: 16 марта 2017
Статья
Baranov A., Baranov P. Automatic Control and Computer Sciences. 2016. Vol. 50. No. 8. P. 759-764.

We study the value distributions for the control cyclic redundancy check (CRC) of length k, drawn at the data section of volume n. The behavior of CRC value distribution is examined at large n and fixed values of k (k = const, n → ∞). With the application of the character theory, we find the conditions of asymptomatic uniformity of the CRC distribution. The asymptomatic results can be applied during the assessment of errors of a series of protocols such as USB, X.25, HDLC, Bluetooth, Ethernet, etc.

Добавлено: 16 марта 2017
Статья
Babash A. V. Automatic Control and Computer Sciences. 2016. Vol. 50. No. 8. P. 749-758.
Добавлено: 26 февраля 2017
Статья
Dworzanski L. W., Lomazova I. A. Automatic Control and Computer Sciences. 2013. Vol. 47. No. 7. P. 393-402.

Nested Petri nets (NP-nets) is an extension of Petri net formalism within the “nets-within-nets” approach, when tokens in a marking are Petri nets wich have autonomous behavior and synchronize with the system net. The formalism of NP-nets allows modeling multilevel multiagent systems with dynamic structure in a natural way. Currently there is no tool support for NP-nets simulation and analysis. The paper proposes translation of NP-nets into colored Petri nets and using CPN Tools as a virtual machine for NP-nets modeling, simulation and automatic verification.

Добавлено: 10 декабря 2013
Статья
Baranov A., Baranov P. Automatic Control and Computer Sciences. 2018. Vol. 52. No. 8. P. 1049-1058.
Добавлено: 29 декабря 2019
Статья
Shershakov S. Automatic Control and Computer Sciences. 2016. Vol. 50. No. 7. P. 477-485.
Добавлено: 1 марта 2017
Статья
Konnov I., Podymov V.V., Volkanov D. et al. Automatic Control and Computer Sciences. 2014. Vol. 48. No. 7. P. 534-542.
Добавлено: 29 сентября 2015
Статья
Beliaev Mikhail, Tsesko V. Автоматика и вычислительная техника. 2012. Т. 7. № 46. С. 324-330.

Абстракт на русском языке

Добавлено: 3 июля 2019
Статья
Sukhoparov M., Bazhaev N., Krivtsova I. et al. Automatic Control and Computer Sciences. 2017. No. 51 (8). P. 992-999.

A wireless network being affected by a broadcast storm attack has been considered to determine the availability of autonomous nodes and its ability to perform functional tasks under information influence. The conditions for the hacker attacks from a potential intruder have been determined. A wireless device availability analysis has been carried out. A model for determining the technical characteristics of the wireless self-organizing network device has been proposed.

Добавлено: 23 апреля 2019
Статья
Baranov A., Baranov P. Automatic Control and Computer Sciences. 2017. Vol. 51. No. 8. P. 959-964.
Добавлено: 18 февраля 2019
Статья
Zakharov V., Чемерицкий Е. В. Automatic Control and Computer Sciences. 2015. Vol. 49. No. 7.
Designing of network update algorithms is an important line of research in the development of software for new generation of telecommunication networks – Software Defined Networks. A specific case of Network Update Problem is that of seamless recovering of network configurations after the loss of some forwarding rules as it may happens e.g. due to expiry of their time-outs. This paper initiates a systematic study of this problem in the framework of a formal model of Software Defined Networks. As the result we present two algorithms for safe and correct insertion of lost forwarding rules in SDN flow-tables and show that in general case seamless recovering of network configurations can not be achieved without using forwarding rules with multiple priorities.
Добавлено: 13 октября 2015
Статья
Mitsyuk A. A., Shugurov I. Automatic Control and Computer Sciences. 2016. Vol. 50. No. 7. P. 460-470.

Извлечение процессов (process mining) – новая и активно развивающаяся область исследований, тесно связанная с управлением процессами, формальными моделями процессов и извлечением данных (data mining). Одна из основных задач извлечения процессов – синтез (извлечение) модели процесса на основании анализа журнала событий. Разработан широкий спектр алгоритмов для извлечения, анализа и усовершенствования моделей процессов. Журналы событий реальных систем часто содержат шум различных видов. В данной работе описываются основные причины возникновения шума в журналах событий и изучается влияние шума на эффективность применения основных алгоритмов извлечения процессов. Приводятся экспериментальные результаты применения основных алгоритмов извлечения моделей процессов к искусственным журналам событий с шумами различного типа. Для этого специальным образом сгенерированные журналы событий с шумом обрабатывались с использованием четырех основных методов извлечения процессов. Хотя современные алгоритмы могут справляться с некоторыми типами шума, в большинстве случаев их применение не приводит к получению удовлетворительного результата. Таким образом, существует необходимость в разработке более совершенных подходов для журналов событий с шумом.

Добавлено: 10 октября 2016
Статья
Zakharov V., Gnatenko A. R. Automatic Control and Computer Sciences. 2019. Vol. 53. No. 7. P. 506-524.

One of the most simple models of computation which is suitable for representation of reactive systems behaviour is a nite state transducer which operates over an input alphabet of control signals and an output alphabet of basic actions. A behaviour of such a reactive system displays itself in the correspondence between ows of control signals and compositions of basic actions performed by the system. We believe that behaviour of this kind requires more suitable and expressive means for formal speci cations than conventional LTL. In this paper we de ne some new (as far as we know) extension LP-LTL of Linear Temporal Logic speci cally intended for describing the properties of transducers computations. In this extension the temporal operators are parameterized by sets of words (languages) which represent distinguished flows of control signals that impact on a reactive system. Basic predicates in our variant of temporal logic are also languages in the alphabet of basic actions of a transducer; they represent the expected response of a transducer to the specified environmental influences. In our earlier papers we considered model checking problem for LP-LTL and LP-CTL and showed that this problem has effective solutions. The aim of this paper is to estimate the expressive power of LP-LTL by comparing it with some well known logics widely used in computer science for specification of reactive systems behaviour. We discovered that a restricted variant LP-1-LTL of our logic is more expressive than LTL and another.

Добавлено: 17 октября 2019
Статья
Zakharov V., Temerbekova G. Automatic Control and Computer Sciences. 2017. Vol. 51. No. 7. P. 523-530.
Добавлено: 13 октября 2016
Статья
Zakharov V., Jaylauova S. Automatic Control and Computer Sciences. 2017. Vol. 51. No. 7. P. 689-700.
Добавлено: 19 декабря 2017
Статья
Akhin M., Kolton S., Ицыксон В. М. Automatic Control and Computer Sciences. 2015. Vol. 49. No. 7. P. 413-419.
Добавлено: 12 ноября 2018
Статья
Akhin M., Beliaev Mikhail, Itsykson Vladimir. Automatic Control and Computer Sciences. 2014. Vol. 7. No. 48. P. 389-397.
Добавлено: 3 июля 2019
Статья
Salakhutdinova K., Krivtsova I., Sukhoparov M. et al. Automatic Control and Computer Sciences. 2018. Vol. 8. No. 52. P. 1101-1104.

Abstract: Properties of using various assembler commands, as well as their combined application, have been investigated in order to prepare a final determination as to whether they belong to a known program. Conclusions on the effect of the ratio used in the creation of unified signatures on result of identifications are presented.

Добавлено: 23 апреля 2019
Статья
Tvardovskii A., El-Fakih K., Gromov M. et al. Automatic Control and Computer Sciences. 2017. Vol. 51. No. 7. P. 724-730.
Добавлено: 31 октября 2018
Статья
Beliaev Mikhail, Petrov M., Gagarski K. et al. Automatic Control and Computer Sciences. 2015. Vol. 7. No. 49. P. 466-472.
Добавлено: 3 июля 2019
1 2