• A
  • A
  • A
  • АБB
  • АБB
  • АБB
  • А
  • А
  • А
  • А
  • А
Обычная версия сайта
Найдено 50 публикаций
Сортировка:
по названию
по году
Статья
Zakharov V.A., Volkanov D. Y., Zorin D. et al. Programming and Computer Software. 2015. Vol. 41. No. 6. P. 325-335.

Checking the correctness of distributed systems is one of the most difficult and urgent problems in software engineering. A combined toolset for the verification of real-time distributed systems (RTDS) is described. RTDSs are specified as statecharts in the Universal Modeling Language (UML). The semantics of statecharts is defined by means of hierarchical timed automata. The combined toolset consists of a UML statechart editor, a verification tool for model checking networks of real-time automata in UPPAAL, and a translator of UML statecharts into networks of timed automata. The focus is on the translation algorithm from UML statecharts into networks of hierarchical timed automata. To illustrate the proposed approach to the verification of RTDSs, a toy example of a real-time crossroad traffic control system is analyzed.

Добавлено: 13 октября 2015
Статья
Turlapov V. E., Юсов Е. Programming and Computer Software. 2008. Vol. 34. No. 5. P. 245-256.
Добавлено: 1 ноября 2008
Статья
Kalenkova A.A. Programming and Computer Software. 2012. Vol. 38. No. 1. P. 43-56.

This paper considers an algorithm of automatic workflow optimization that, unlike well-known redesign algorithms for workflows [1, 2], can analyze arbitrary structures containing conditional branches and cycles. This algorithm operates with workflows without structural conflicts and, in the course of operation, uses execution conditions obtained as a result of application of the Boolean verification algorithm (BVA) proposed earlier in [3]. A modified BVA is proposed and its computational complexity is estimated.

Добавлено: 13 июля 2013
Статья
S. S. Gaissaryan, Nurmukhametov A., Kurmangaleev S. et al. Programming and Computer Software. 2015. Vol. 41. No. 4. P. 231-236.
Добавлено: 8 сентября 2016
Статья
Kalenkova A. Programming and Computer Software. 2010. Vol. 36. No. 5. P. 276-288.
Добавлено: 13 июля 2013
Статья
Petrovskiy M., Korolev V., Korchagin A. et al. Programming and Computer Software. 2018. Vol. 44. No. 5. P. 353-362.
Добавлено: 5 декабря 2018
Статья
Dworzanski L. W., Lomazova I. A. Programming and Computer Software. 2016. Vol. 42. No. 5. P. 292-306.

Multi-level multi-agent systems (MASs) with dynamic structure are widely used in solving important applied problems in telecommunication, transportation, social, and other systems. Therefore, ensuring correct behavior of such systems is an actual and important task. One of the most error-prone stages of system development in the framework of model-oriented approach is the implementation stage, in the course of which a program code is constructed based on the model developed. This paper presents an algorithm for automated translation of MAS models represented as nested Petri nets into systems of distributed components. Nested Petri nets are the extension of Petri nets in the framework of the nets-within-nets approach, which assumes that tokens in a Petri net may themselves be Petri nets, possess autonomous behavior, and interact with other tokens of the net. This makes it possible to model MASs with dynamic structure in a natural way. The translation presented in this paper preserves distribution level and important behavioral properties (safety, liveness, and conditional liveness) of the original model and ensures fairness of the target system execution. The use of such translation makes it possible to automate construction of distributed MASs by models of nested Petri nets. As a test example, translation of nested Petri nets into systems of distributed components was implemented on the basis of the EJB component technology.

Добавлено: 27 сентября 2016
Статья
Devyanin P., Kuliamin V., Petrenko A. K. et al. Programming and Computer Software. 2016. Vol. 42. No. 4. P. 198-205.

ecomposition is an important phase in the design of medium and large-scale systems. Various architectures of software systems and decomposition methods are studied in numerous publications. Presently, formal specifications of software systems are mainly used for experimental purposes; for this reason, their size and complexity are relatively low. As a result, in the development of a nontrivial specification, different approaches to the decomposition should be compared and the most suitable approach should be chosen. In this paper, the experience gained in the deductive verification of the formal specification of the mandatory entity-role model of access and information flows control in Linux (MROSL DP-model) using the formal Event-B method and stepwise refinement technique is analyzed. Two approaches to the refinementbased decomposition of specifications are compared and the sources and features of the complexity of the architecture of the model are investigated.

Добавлено: 12 сентября 2016
Статья
Khoroshilov A. V., Мандрыкин М. У., Мутилин В. С. et al. Programming and Computer Software. 2015. Vol. 41. No. 1. P. 49-64.
Добавлено: 1 ноября 2015
Статья
Get’man I., Ivannikov V., Markin Y. et al. Programming and Computer Software. 2016. Vol. 42. No. 5. P. 316-322.

This paper proposes a new object model of data for the in-depth analysis of network traffic. In contrast to the model used by most modern network analyzers (for example, Wireshark and Snort), the proposed model supports data stream reassembling with subsequent parsing. The model also provides a convenient universal mechanism for binding parsers, thus making it possible to develop completely independent parsers. Moreover, the proposed model allows processing modified—compressed or encrypted—data. This model forms the basis of the infrastructure for the in-depth analysis of network traffic.

Добавлено: 13 ноября 2016
Статья
Luciv D., Koznov D., Terekhov A. et al. Programming and Computer Software. 2018. Vol. 44. No. 5. P. 335-343.
Добавлено: 1 марта 2019
Статья
Barash L., Guskova M., Shchur L. Programming and Computer Software. 2017. Vol. 43. No. 3. P. 145-160.

 

 

Добавлено: 24 марта 2017
Статья
Lebedev P. A. Programming and Computer Software. 2016. Vol. 42. No. 3. P. 142-154.
Добавлено: 25 ноября 2014
Статья
Ефимов В. Ю., Батузов К. А., Падарян В. А. et al. Programming and Computer Software. 2016. Vol. 42. No. 3. P. 174-186.

A technology of the deterministic replay of an execution process in virtual machines can be used for debugging, improving reliability and robustness, software development and incident investigation (including reverse engineering of malware). The paper describes an implementation of deterministic replay for guest machines based on IA-32 in the emulator QEMU. This implementation minimizes the list of replayed devices. The organization of QEMU is discussed in detail, and the techniques used in the implementation are thoroughly explained. The key performance characteristics, such as the size of log of nondeterministic events and slowdown are experimentally measured.

Добавлено: 27 марта 2017
Статья
A.I. Zobnin. Programming and Computer Software. 2010. Vol. 36. No. 2. P. 75-82.
Добавлено: 1 октября 2014
Статья
Khoroshilov A. V., Мандрыкин М. У. Programming and Computer Software. 2015. Vol. 41. No. 4. P. 197-207.
Добавлено: 30 октября 2015
Статья
D. Yu. Turdakov, Pastukhov R., Korshunov A. et al. Programming and Computer Software. 2015. Vol. 41. No. 5. P. 302-306.
Добавлено: 13 сентября 2016
Статья
S. D. Kuznetsov, Turdakov D. Y., Пастухов Р. К. et al. Programming and Computer Software. 2015. Vol. 41. No. 5. P. 302-306.
Добавлено: 23 января 2018
Статья
Kuplyakov D., Shalnov E., Konushin A. Programming and Computer Software. 2017. Vol. 43. No. 4. P. 224-229.
Добавлено: 14 марта 2018
Статья
Denis Turdakov, Astrakhantsev N., Fedorenko D. Programming and Computer Software. 2015. Vol. 41. No. 6. P. 336-349.
Добавлено: 26 августа 2016
Статья
Armenta-Cano F. A., Tchernykh A., Cortes-Mendoza J. M. et al. Programming and Computer Software. 2017. Vol. 43. No. 3. P. 204-215.

In this paper, we address energy-aware online scheduling of jobs with resource contention. We propose an optimization model and present new approach to resource allocation with job concentration taking into account types of applications and heterogeneous workloads that could include CPU-intensive, diskintensive, I/O-intensive, memory-intensive, network-intensive, and other applications. When jobs of one type are allocated to the same resource, they may create a bottleneck and resource contention either in CPU, memory, disk or network. It may result in degradation of the system performance and increasing energy consumption. We focus on energy characteristics of applications, and show that an intelligent allocation strategy can further improve energy consumption compared with traditional approaches. We propose heterogeneous job consolidation algorithms and validate them by conducting a performance evaluation study using the Cloud Sim toolkit under different scenarios and real data. We analyze several scheduling algorithms depending on the type and amount of information they require.

Добавлено: 10 августа 2018