Matrix Approach to Model Matching of Asynchronous Sequential Machines

Xu, Xiangru; Hong, Youwei

doi:10.1109/tac.2013.2259957

Cited by 128 publications

(54 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then, as an application of canalising Boolean mapping, the required control has been designed. Some other new results and applications of STP can be found in [15][16][17][18][19].…”

Section: Introductionmentioning

confidence: 98%

Topological structure and the disturbance decoupling problem of singular Boolean networks

Meng

Feng

2014

IET Control Theory & Applications

View full text Add to dashboard Cite

The general singular Boolean networks are proposed in this study, motivated by the algebraic form of dynamicalgebraic Boolean networks via the semi-tensor product of matrices. First, one of the most important problems for this kind of networks, solvability problem, is discussed. Then, in order to calculate the fixed points and cycles, the transition matrix of a singular Boolean network is defined, which contains all the state transferring information. At last, the general singular Boolean control networks are considered with their solvability and the disturbance decoupling problem is presented and solved by a constant control. Illustrative examples are given to show the feasibility of the results.

show abstract

“…Then, as an application of canalising Boolean mapping, the required control has been designed. Some other new results and applications of STP can be found in [15][16][17][18][19].…”

Section: Introductionmentioning

confidence: 98%

Topological structure and the disturbance decoupling problem of singular Boolean networks

Meng

Feng

2014

IET Control Theory & Applications

View full text Add to dashboard Cite

show abstract

“…As long as the asynchronous machine has stable reachability enough to attain the desired behaviour, we can achieve model matching using an appropriate input sequence. A number of theoretical studies are addressed on the existence and construction of corrective controllers for various control objectives [1][2][3][4][5][6][7]. The applicability of corrective control theory to real-world systems is validated in [8,9].…”

Section: Introductionmentioning

confidence: 99%

Corrective control for transient faults with application to configuration controllers

Yang

Kwak

2015

IET Control Theory & Applications

View full text Add to dashboard Cite

A novel design methodology of corrective control is proposed for fault-tolerance against transient faults in input/output asynchronous sequential machines. The main objective is to lessen controller complexity by proposing a structure of corrective control that employs no state observer, which is required in the former studies for input/output control of asynchronous machines. The form of the output feedback is also simplified as a unit character instead of bursts. Although the exact identification of the machine's state is infeasible, the proposed controller achieves immediate faulttolerance against transient faults that cause unauthorised state transitions. As a case study, the authors apply the proposed control scheme to implementing configuration controllers for space-borne field programmable gate array with hardware redundancy in which single event upset faults may happen by the radiation effect.

show abstract

“…By this mathematical tool, it is very convenient to convert a finite-valued system into an algebraic form, based on which many fundamental and landmark results have been presented for the Boolean network [2, 4-8, 11-14, 16-22, 39], the general mix-valued logical network [9,26,40], the graph coloring [33], the fault detection of circuits [15], the finite automata [34,35], and so on.…”

Section: Introductionmentioning

confidence: 99%

Consensus of finite-field networks with switching topologies and linear protocols

Wang

Guo

2014

Proceedings of the 33rd Chinese Control Conference

View full text Add to dashboard Cite

This paper investigates the consensus of finite-field networks with switching topologies and linear protocols by using the semi-tensor product (STP) method, and presents a number of new results. First, an algebraic form of finite-field networks with switching topologies and linear protocols is obtained via STP. Second, based on the algebraic form and the switching point reachability, a necessary and sufficient condition is presented for the consensus of finite-field networks under arbitrary switching signal. Finally, an illustrative example is given to verify the obtained new results. The study of the illustrative example shows that the new results presented in this paper are very effective in the consensus analysis of finite-field networks with switching topologies and linear protocols under arbitrary switching signal.

show abstract

Matrix Approach to Model Matching of Asynchronous Sequential Machines

Cited by 128 publications

References 15 publications

Topological structure and the disturbance decoupling problem of singular Boolean networks

Topological structure and the disturbance decoupling problem of singular Boolean networks

Corrective control for transient faults with application to configuration controllers

Consensus of finite-field networks with switching topologies and linear protocols

Contact Info

Product

Resources

About