AADL+: a simulation-based methodology for cyber-physical systems

AADL (architecture analysis and design language) concentrates on the modeling and analysis of application system architectures. It is quite popular for its simple syntax, powerful functionality and extensibility and has been widely applied in embedded systems for its advantage. However, it is not enough for AADL to model cyber-physical systems (CPS) mainly because it cannot be used to model the continuous dynamic behaviors. This paper proposes an approach to construct a new sublanguage of AADL called AADL+, to facilitate the modeling of not only the discrete and continuous behavior of CPS, but also interaction between cyber components and physical components. The syntax and semantics of the sublanguage are provided to describe the behaviors of the systems. What’s more, we develop a plug-in to OSATE (open-source AADL tool environment) for the modeling of CPS. And the plug-in supports syntax checking and simulation of the system model through linking with modelica. Finally, the AADL+ annex is successfully applied to model a lunar rover control system.     

A survey on the security of cyber-physical systems

Cyber-physical systems (CPSs) are integrations of computation, communication, control and physical processes. Typical examples where CPSs are deployed include smart grids, civil infrastructure, medical devices and manufacturing. Security is one of the most important issues that should be investigated in CPSs and hence has received much attention in recent years. This paper surveys recent results in this area and mainly focusses on three important categories: attack detection, attack design and secure estimation and control. We also discuss several future research directions including risk assessment, modeling of attacks and attacks design, counter-attack strategy and testbed and validation.     

Stealthy switching attacks on sensors against state estimation in cyber-physical systems

This article focuses on designing sensor attacks to deteriorate the state estimation in cyber-physical systems. The scenario that the malicious attack signals can be injected into different but limited number of sensor communication channels is considered. The state estimation error variations and innovation variations are adopted to measure attack performance and attack stealthiness, respectively. A switching attack strategy is proposed, under which the estimation error variations are driven to the predesigned target value and the norm of innovation variations remains at a small level. The switching attack design problem is formulated as a discrete switched optimal control problem which can be solved by dynamic programming, while the computational burden is heavy. To overcome this difficulty, by using pruning technique to remove the redundant matrices generated in dynamic programming, the quadratic optimization problem becomes numerically tractable. In this way, the suboptimal attack signal sequence and switching sequence can be acquired. Finally, a simulation example is provided to illustrate the effectiveness of the proposed attack strategy.     

Fault estimation observer design for a class of nonlinear multiagent systems in finite‐frequency domain

This paper focuses on the fault estimation observer design problem in the finite‐frequency domain for a class of Lipschitz nonlinear multiagent systems subject to system components or actuator fault. First, the relative output estimation error is defined based on the directed communication topology of multiagent systems, and an observer error system is obtained by connecting adaptive fault estimation observer and the state equation of the original system. Then, sufficient conditions for the existence of the fault estimation observer are obtained by using a generalized Kalman‐Yakubovich‐Popov lemma and properties of the matrix trace, which guarantee that the observer error system satisfies robustness performance in the finite‐frequency domain. Meanwhile, the pole assignment method is used to configure the poles of the observer error system in a certain area. Finally, the simulation results are presented to illustrate the effectiveness of the proposed method.     

Lowest priority first based feasibility analysis of real-time systems

The feasibility problem of periodic tasks under fixed priority systems has always been a critical research issue in real-time systems and a number of feasibility tests have been proposed to guarantee the timing requirements of real-time systems. These tests can be broadly classified into: (a) inexact and (b) exact tests. The inexact tests are applied to the task sets that present lower utilization, while the exact tests become inevitable when system utilization is high. The exact tests can be further classified into: (a) Scheduling Points Tests (SPT) and (b) Response Time Tests (RTT). The SPT analyze task set feasibility at the arrival times while the RTT utilize fixed-point techniques to determine task feasibility. All of the available exact feasibility tests, whichever class it belongs to, share pseudo-polynomial complexity. Therefore, the aforementioned tests become impractical for online systems. Currently, both SPT and RTT employ the Highest Priority First (HPF) approach, which determines the system feasibility by testing the schedulability of individual tasks in the decreasing order of priority. In contrast, this work exploits the Lowest Priority First (LPF) alternative which is an aggressive solution based on the observation that the system infeasibility is primarily due to the lower priority tasks and not because of the higher priority tasks. For the average case analysis, our technique demonstrates promising results. Moreover, in the worst case scenario our solution is no inferior to the existing state of the art alternatives. We compare our proposed technique with the existing tests: (a) by counting the number of scheduling points used by a test that belongs to the SPT, (b) by counting the number of inner-most loops executed by an algorithm for the RTT, and (c) by measuring the actual running time of the existing alternatives.     

非整数阶系统的频率辨识

使用频响数据对非整数阶系统作频域模拟和辨识.首先,定义了非整数阶微分器的频率特性,进而给出了非整数阶系统的余奎斯特曲线的绘制方法.然后,运用方程式误差的辅助变量法,根据实部和虚部频率数据进行非整数阶系统的频率辨识.最后,通过两个数字仿真来验证这种辨识方法.     

Fuzzy methodology for frequency response estimation of uncertain dynamic systems

Fuzzy frequency response: definition and analysis for uncertain dynamic systems is proposed in this paper. In terms of transfer function, the uncertain dynamic system is partitioned into several linear sub‐models and organized according to Takagi–Sugeno fuzzy representation. The main contribution of this paper is to demonstrate through the proposal of a Theorem that fuzzy frequency response is a boundary in the magnitude and phase Bode plots. Low‐ and high‐frequency analysis of fuzzy dynamic model is obtained by varying the frequency ω from zero to infinity. Copyright © 2011 John Wiley & Sons, Ltd.     

Demand-based schedulability analysis for real-time multi-core scheduling

In real-time systems, schedulability analysis has been widely studied to provide offline guarantees on temporal correctness, producing many analysis methods. The demand-based schedulability analysis method has a great potential for high schedulability performance and broad applicability. However, such a potential is not yet fully realized for real-time multi-core scheduling mainly due to (i) the difficulty of calculating the resource demand under dynamic priority scheduling algorithms that are favorable to multi-cores, and (ii) the lack of understanding how to combine the analysis framework with deadline-miss conditions specialized for those scheduling algorithms. Addressing those two issues, to the best of our knowledge, this paper presents the first demand-based schedulability analysis for dynamic job-priority scheduling algorithms: EDZL (Earliest Deadline first until Zero-Laxity) and LLF (Least Laxity First), which are known to be effective for real-time multi-core scheduling. To this end, we first derive demand bound functions that compute the maximum possible amount of resource demand of jobs of each task while the priority of each job can change dynamically under EDZL and LLF. Then, we develop demand-based schedulability analyses for EDZL and LLF, by incorporating those new demand bound functions into the existing demand-based analysis framework. Finally, we combine the framework with additional deadline-miss conditions specialized for those two laxity-based dynamic job-priority scheduling algorithms, yielding tighter schedulability analyses. Via simulations, we demonstrate that the proposed schedulability analyses outperform the existing schedulability analyses for EDZL and LLF.     

RealNet: a neural network architecture for real-time systems scheduling

Real-time embedded systems are spreading to more and more new fields and their scope and complexity have grown dramatically in the last few years. Nowadays, real-time embedded computers or controllers can be found everywhere, both in very simple devices used in everyday life and in professional environments. Real-time embedded systems have to take into account robustness, safety and timeliness. The most-used schedulability analysis is the worst-case response time proposed by Joseph and Pandya (Comput J 29:390–395,1986). This test provides a bivaluated response (yes/no) indicating whether the processes will meet their corresponding deadlines or not. Nevertheless, sometimes the real-time designer might want to know, more exactly, the probability of the processes meeting their deadlines, in order to assess the risk of a failed scheduling depending on critical requirements of the processes. This paper presents RealNet, a neural network architecture that will generate schedules from timing requirements of a real-time system. The RealNet simulator will provide the designer, after iterating and averaging over some trials, an estimation of the probability that the system will not meet the deadlines. Moreover, the knowledge of the critical processes in these schedules will allow the designer to decide whether changes in the implementation are required.This revised version was published online in November 2004 with a correction to the accepted date.     

Mixed scheduling with heterogeneous delay constraints in cyber-physical systems

The physical space and the cyber space are deeply coupled in Cyber-Physical Systems (CPS). The traffic flows are constrained by heterogeneous delay constraints. In order to provide real-time and predictable communication, the paper combines the distributed scheduling algorithm with game theory. A non-cooperative game is proposed to form the scheduling set in the contention-based multiple-access scenario. In the game, each player only has its delay knowledge and makes decision without the information of other competing players. The payoff function is designed to encourage players to give the transmission chance to the player with urgent packets. Simulation results demonstrate that the game-theoretic scheduling approach can improve the real-time performance compared with the existing scheduling algorithms under different scenarios.     

分布式电网CPS 系统数据攻击下的状态估计

电力物理网络通过构建信息网络进行优化调控并构成信息物理融合系统, 实现大规模分布式系统的优化控制, 随之而来的问题是病毒、黑客入侵、拒绝服务等来自信息网络的威胁, 导致物理系统恶意破坏. 鉴于此, 以攻击可检测为前提, 建立攻击信号下的电力系统分布式动态模型, 设计动态状态估计器检测受攻击的信号, 并估计其原始信号. 最后通过3 机9 节点分布式电网系统仿真实验验证了所设计的状态估计器对于数据攻击检测的有效性.

     

Network invariants for real-time systems

We extend the approach of model checking parameterized networks of processes by means of network invariants to the setting of real-time systems. We introduce timed transition structures (which are similar in spirit to timed automata) and define a notion of abstraction that is safe with respect to linear temporal properties. We strengthen the notion of abstraction to allow a finite system, then called network invariant, to be an abstraction of networks of real-time systems. In general the problem of checking abstraction of real-time systems is undecidable. Hence, we provide sufficient criteria, which can be checked automatically, to conclude that one system is an abstraction of a concrete one. Our method is based on timed superposition and discretization of timed systems. We exemplify our approach by proving mutual exclusion of a simple protocol inspired by Fischer’s protocol, using the model checker TLV. Part of this work was done during O. Grinchtein’s stay at Weizmann Institute. This author was supported by the European Research Training Network “Games”.     

Slack computation for DVS algorithms in fixed-priority real-time systems using fluid slack analysis

This work presents a scheduling algorithm to reduce the energy of hard real-time tasks with fixed priorities assigned in a rate-monotonic policy. Sets of independent tasks running periodically on a processor with dynamic voltage scaling (DVS) are considered as well. The proposed online approach can cooperate with many slack-time analysis methods based on low-power work demand analysis (lpWDA) without increasing the computational complexity of DVS algorithms. The proposed approach introduces a novel technique called low-power fluid slack analysis (lpFSA) that extends the analysis interval produced by its cooperative methods and computes the available slack in the extended interval. The lpFSA regards the additional slack as fluid and computes its length, such that it can be moved to the current job. Therefore, the proposed approach provides the cooperative methods with additional slack. Experimental results show that the proposed approach combined with lpWDA-based algorithms achieves more energy reductions than do the initial algorithms alone.     

Fault estimation observer design for discrete‐time systems in finite‐frequency domain

This paper proposes a framework of fault estimation observer design in finite‐frequency domain for discrete‐time systems. First, under the multiconstrained idea, a full‐order fault estimation observer in finite‐frequency domain is designed to achieve fault estimation by using the generalized Kalman–Yakubovich–Popov lemma to reduce conservatism generated by the entire frequency domain. Then, a reduced‐order fault estimation observer is constructed, which results in a new fault estimator to realize fault estimation using current output information. Furthermore, by introducing slack variables, improved results on full‐order fault estimation observer and reduced‐order fault estimation observer design with finite‐frequency specifications are obtained such that different Lyapunov matrices can be separately designed for each constraint. Simulation results are presented to illustrate the advantages of the theoretic results obtained. Copyright © 2014 John Wiley & Sons, Ltd.     

分数阶系统频域辨识算法

分数阶微积分提供了一个很好的工具来描述一些复杂的实际系统,比整数阶模型更简洁准确.针对分数阶系统建模问题,阐述了一种同元次分数阶系统频域辨识的极大似然算法.为此首先简要地介绍了同元次分数阶系统的传递函数表达形式,然后在此基础上推导了分数阶系统频域极大似然算法,利用拉格朗日法证明了似然函数和代价函数的等价性,从而将辨识问题归结为一等价的优化问题,并进一步对采用Gauss-Newton优化计算方法进行了讨论.最后通过仿真实例验证了其有效性.     

线性广义系统P型迭代学习控制离散频域收敛性

针对一类线性广义系统,研究其P型迭代学习控制在离散频域中的收敛性态。在离散频域中,对广义系统进行奇异值分解后,利用傅里叶级数系数的性质和离散的Parseval能量等式,推演了一阶P型迭代学习控制律跟踪误差的离散能量频谱的递归关系和特性,获得了学习控制律收敛的充分条件;讨论了二阶P型迭代学习控制律的收敛条件。仿真实验验证了理论的正确性和学习律的有效性。     

A frequency domain approach to fault detection in sampled-data systems

This paper deals with fault detection problems in sampled-data (SD) systems. A tool is first introduced for the analysis of intersample behavior of SD systems in the frequency domain from the viewpoint of fault detection and isolation. Based on it, a direct design approach of fault detection systems for SD systems is proposed, and further the problem of full decoupling from unknown disturbances is studied.     

Period sensitivity analysis and D-P domain feasibility region in dynamic priority systems

In the design of a real-time application it is fundamental to know how a change in the task parameters would affect the feasibility of the system. Relaxing the classical assumptions on static task sets with fixed periods and deadlines can give higher resource utilisation and better performance. But the changes on task parameters have to be done always maintaining feasibility. In practice, period and deadline modifications are only necessary on single tasks. Our work focuses on finding the feasibility region of deadlines and periods (called D-P feasibility region) for a single task in the context of dynamic, uniprocessor scheduling of hard real-time systems. This way, designers can choose the optimal deadline and period pairs that best fit application requirements. We provide an exact and an approximated algorithm to calculate this region. We will show that the approximated solution is very close to the exact one and it takes considerably less time.     

A novel approach for the detection of anomalous energy consumption patterns in industrial cyber-physical systems

Most scenarios emerging from the Industry 4.0 paradigm rely on the concept of cyber-physical production systems (CPPS), which allow them to synergistically connect physical to digital setups so as to integrate them over all stages of product development. Unfortunately, endowing CPPS with AI-based functionalities poses its own challenges: although advances in the performance of AI models keep blossoming in the community, their penetration in real-world industrial solutions has not so far developed at the same pace. Currently, 90% of AI-based models never reach production due to a manifold of assorted reasons not only related to complexity and performance: decisions issued by AI-based systems must be explained, understood and trusted by their end users. This study elaborates on a novel tool designed to characterize, in a non-supervised, human-understandable fashion, the nominal performance of a factory in terms of production and energy consumption. The traceability and analysis of energy consumption data traces and the monitoring of the factory's production permit to detect anomalies and inefficiencies in the working regime of the overall factory. By virtue of the transparency of the detection process, the proposed approach elicits understandable information about the root cause from the perspective of the production line, process and/or machine that generates the identified inefficiency. This methodology allows for the identification of the machines and/or processes that cause energy inefficiencies in the manufacturing system, and enables significant energy consumption savings by acting on these elements. We assess the performance of our designed method over a real-world case study from the automotive sector, comparing it to an extensive benchmark comprising state-of-the-art unsupervised and semi-supervised anomaly detection algorithms, from classical algorithms to modern generative neural counterparts. The superior quantitative results attained by our proposal complements its better interpretability with respect to the rest of algorithms in the comparison, which emphasizes the utmost relevance of considering the available domain knowledge and the target audience when design AI-based industrial solutions of practical value. Finally, the work described in this paper has been successfully deployed on a large scale in several industrial factories with significant international projection.     

Identification and frequency domain analysis of non-stationary and nonlinear systems using time-varying NARMAX models

This paper introduces a new approach for nonlinear and non-stationary (time-varying) system identification based on time-varying nonlinear autoregressive moving average with exogenous variable (TV-NARMAX) models. The challenging model structure selection and parameter tracking problems are solved by combining a multiwavelet basis function expansion of the time-varying parameters with an orthogonal least squares algorithm. Numerical examples demonstrate that the proposed approach can track rapid time-varying effects in nonlinear systems more accurately than the standard recursive algorithms. Based on the identified time domain model, a new frequency domain analysis approach is introduced based on a time-varying generalised frequency response function (TV-GFRF) concept, which enables the analysis of nonlinear, non-stationary systems in the frequency domain. Features in the TV-GFRFs which depend on the TV-NARMAX model structure and time-varying parameters are investigated. It is shown that the high-dimensional frequency features can be visualised in a low-dimensional time–frequency space.