Fig 4 - available via license: Creative Commons Attribution 4.0 International
Content may be subject to copyright.
Source publication
To cope with growing computing performance requirements, cyber-physical systems architectures are moving toward heterogeneous high-performance computer architectures and networks. Such architectures, however, incur intricate side effects that challenge traditional software design and integration. The programming paradigm can take a key role in mast...
Context in source publication
Context 1
... locations but they must co-operate on the factory floor or in a process plant to achieve a common goal. In the future systems, even remote databases and data-processing services are accessible by connections to external servers. To facilitate the exchange of information, distributed CPSs typically feature a middleware layer as illustrated in Fig. 4 which establishes and manages the transparent distribution of data and ensures its consistent representation. By hiding heterogeneity and distribution to the individual applications, the middleware eases significantly the design and reuse of applications. A particular challenge for middleware in safety critical environments is that the ...
Citations
... Таким чином, носій £ арифметичної ППА складають n-арні частково-рекурсивні арифметичні функції виду N N n → та n-арні частково-рекурсивні арифметичні предикати виду N T F n o^, , n N ∈ (далі -функції та предикати) [15]. Сигнатуру ж ППА (позначатимемо тут Ω) складають операції суперпозиції, розгалуження і циклування, що є адекватними уточненнями основних методів конструювання програм [8][9][10][11][12]. ...
... Серія: Технічні науки Нагадаємо формальні визначення цих операцій, деякі позначення та результати. Зауважимо, що при акцентуванні уваги на генетичних особливостях розглядуваних функцій та предикатів у їх позначенні перевага надаватиметься операторній, а при акцентуванні на результатах застосування композицій -термальній формам запису [15]. ...
In automotive and industrial real-time software systems, the primary timing constraints relate to cause-effect chains. A cause-effect chain is a sequence of linked tasks and it typically implements the process of reading sensor data, computing algorithms, and driving actuators. The classic timing analysis computes the maximum end-to-end latency of a given cause-effect chain to verify that its end-to-end deadline can be satisfied in all cases. This information is useful but not sufficient in practice: Software is usually evolving and updates may always alter the maximum end-to-end latency. It would be desirable to judge the quality of a software design a priori by quantifying how robust the timing of a given cause-effect chain will be in the presence of software updates. In this paper, we derive robustness margins which guarantee that if software extensions stay within certain bounds, then the end-to-end deadline of a cause-effect chain can still be satisfied. Robustness margins are also useful to know if the system model has uncertain parameters. A robust system design can tolerate bounded deviations from the nominal system model without violating timing constraints. The results are applicable to both the bounded execution time programming model and the (system-level) logical execution time programming model. In this paper, we study both an industrial use case from the automotive industry and analyze synthetically generated experiments with our open-source tool TORO.
