Adaptive Consensus of Two Coupled Heterogeneous Networked Systems With Bidirectional Actions

Li, Xiaobo; Nasr, Emad Abouel; El-Tamimi, Abdulaziz M.; Li, Zhiwu

doi:10.1109/access.2020.2970866

Cited by 12 publications

(6 citation statements)

References 46 publications

(58 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Another interesting direction for future work is to study in more detail on the framework of the supervisor encryption. Besides, security and machine learning issues in heterogeneous networked systems are of much interest [59]- [63].…”

Section: Discussionmentioning

confidence: 99%

Homomorphic Encryption of Supervisory Control Systems Using Automata

Zhou

Nasr

et al. 2020

IEEE Access

Self Cite

View full text Add to dashboard Cite

Cyber-physical systems have been highly integrated into many contemporary infrastructures. As this integration deepens, the importance of protecting these systems from unauthorized access and data corruption increases. Nowadays, cyber-physical systems are not well protected against network attacks. One solution is to improve the security of a system by encrypting the transmitted data. In this paper, we consider the encryption of supervisors of discrete event systems modeled with deterministic finite-state automata. We propose an encryption framework of supervisory control systems based on the matrix notation of automata. The purpose of using matrix notation is to make it suitable for homomorphic encryption schemes over integers, which are emerging in the cryptography area. We calculate the entropy of the matrix notation and find that as the size of a system increases, it gets smaller and approaches zero. Owing to the low entropy of the matrix notation, we propose an algorithm to enhance its entropy. By applying the entropy-enhancing process, the distribution characteristics of entries in matrices or vectors can be hidden to avoid a brute force attack. Correspondingly, we propose an entropy restoration algorithm to ensure that the control action can be transmitted correctly.

show abstract

Section: Discussionmentioning

confidence: 99%

Homomorphic Encryption of Supervisory Control Systems Using Automata

Zhou

Nasr

et al. 2020

IEEE Access

Self Cite

View full text Add to dashboard Cite

show abstract

“…The simplified model reveals a constraint between events 11 and 21. Event 11 (21) can successively occur at most three times before an occurrence of event 12 (11). The reason is that after three successive occurrences of event 11 (12), there are three type 1 (2) parts in the manufacturing system.…”

Section: An Applicationmentioning

confidence: 99%

“…Due to the theoretical maturity, DES have received much attention from academy and industry communities. [15][16][17][18][19][20][21][22] However, DES control methods have not yet been extensively applied to industrial scale problems, owing to the state explosion problem: the number of reachable states increases exponentially with that of concurrent components and variables. 23 The intractable number of states may quickly deplete the computer memory and terminate the computation if the given system is structurally complex.…”

Section: Introductionmentioning

confidence: 99%

Model abstraction for discrete-event systems by binary linear programming with applications to manufacturing systems

Cheng

Feng

2021

Science Progress

Self Cite

View full text Add to dashboard Cite

Model abstraction for finite state automata is helpful for decreasing computational complexity and improving comprehensibility for the verification and control synthesis of discrete-event systems (DES). Supremal quasi-congruence equivalence is an effective method for reducing the state space of DES and its effective algorithms based on graph theory have been developed. In this paper, a new method is proposed to convert the supremal quasi-congruence computation into a binary linear programming problem which can be solved by many powerful integer linear programming and satisfiability (SAT) solvers. Partitioning states to cosets is considered as allocating states to an unknown number of cosets and the requirement of finding the coarsest quasi-congruence is equivalent to using the least number of cosets. The novelty of this paper is to solve the optimal partitioning problem as an optimal state-to-coset allocation problem. The task of finding the coarsest quasi-congruence is equivalent to the objective of finding the least number of cosets. Then the problem can be solved by optimization methods, which are respectively implemented by mixed integer linear programming (MILP) in MATLAB and binary linear programming (BLP) in CPLEX. To reduce the computation time, the translation process is first optimized by introducing fewer decision variables and simplifying constraints in the programming problem. Second, the translation process formulates a few techniques of converting logic constraints on finite automata into binary linear constraints. These techniques will be helpful for other researchers exploiting integer linear programming and SAT solvers for solving partitioning or grouping problems. Third, the computational efficiency and correctness of the proposed method are verified by two different solvers. The proposed model abstraction approach is applied to simplify the large-scale supervisor model of a manufacturing system with five automated guided vehicles. The proposed method is not only a new solution for the coarsest quasi-congruence computation, but also provides us a more intuitive understanding of the quasi-congruence relation in the supervisory control theory. A future research direction is to apply more computationally efficient solvers to compute the optimal state-to-coset allocation problem.

show abstract

“…In addition, Petri nets are beneficial to design and analysis of discrete event systems or other formal systems [32, 33, 45 ̶ 57] since they have a simple mathematical representation using a linear matrix of algebra [7], [2]. Also, the modeling paradigm can be used in social networks [22,23], multi-agent systems [21,24] and data analysis systems [38]. Fault-tolerance, fault-recovery, and fault-repair in a system are important issues that should be taken into account in many industrial processes [19, 28, 34, 50 ̶ 52, 56].…”

Section: Introductionmentioning

confidence: 99%

Fault-Recovery and Repair Modeling of Discrete Event Systems Using Petri Nets

Alzalab

et al. 2020

IEEE Access

View full text Add to dashboard Cite

Despite advances in automated manufacturing systems (AMSs), faults occur from time to time, which cannot be avoided in a complex real system. A fault is one of the primary causes of failures making some AMS operations unable to complete, and the diagnosis is one of the most important steps in fault-recovery and repair. This work develops a methodology for investigating the behavior of faults on the resources in discrete event systems that are failure-prone. We tackle the fault-tolerant problem and propose a method to make the system able to continue performing its duties, while the failed resources are under a repair and recovery process. In this work, a failure-safe model is proposed and, at the same time, a method for fault recovery and repair of a faulty element is presented without interrupting task processing due to the occurrence of fault to some elements. We use redundant elements to replace the target elements, and these redundant elements are used to do the same work as the target elements do, when faults occur to the target elements. A target element is an unreliable element that is prone to failure. After a faulty target element is repaired and recovered, its failure model is automatically replaced by its repaired model to indicate that the corresponding element has returned to work. The proposed method is tested using an application example. The results show, compared with those obtained by the studies in the literature, that the proposed method has a great performance and outperforms the existing studies.

show abstract

Adaptive Consensus of Two Coupled Heterogeneous Networked Systems With Bidirectional Actions

Cited by 12 publications

References 46 publications

Homomorphic Encryption of Supervisory Control Systems Using Automata

Homomorphic Encryption of Supervisory Control Systems Using Automata

Model abstraction for discrete-event systems by binary linear programming with applications to manufacturing systems

Fault-Recovery and Repair Modeling of Discrete Event Systems Using Petri Nets

Contact Info

Product

Resources

About