REVERSE ORDER LAW FOR GROUP INVERSE OF PRODUCT OF MATRICES ON SKEW FIELDS

Let Kn×n be the set of all n×n matrices and Krn×n the set {A∈Kn×n|rankA=r} on askew field K. Zhuang [1] denotes by A# the group inverse of A∈Kn×n which is the solu-tion of the euqations:AXA=A, XAX=X, AX=AX.

Solving type-2 fuzzy relation equations via semi-tensor product of matrices

The problem of solving type-2 fuzzy relation equations is investigated. In order to apply semi-tensor product of matrices, a new matrix analysis method and tool, to solve type-2 fuzzy relation equations, a type-2 fuzzy relation is decomposed into two parts as principal sub-matrices and secondary sub-matrices; an r-ary symmetrical-valued type-2 fuzzy relation model and its corresponding symmetrical-valued type-2 fuzzy relation equation model are established. Then, two algorithms are developed for solving type-2 fuzzy relation equations, one of which gives a theoretical description for general type-2 fuzzy relation equations; the other one can find all the solutions to the symmetrical-valued ones. The results can improve designing type-2 fuzzy controllers, because it provides knowledge to search the optimal solutions or to find the reason if there is no solution. Finally some numerical examples verify the correctness of the results/algorithms.

Self-Triggered Set Stabilization of Boolean Control Networks and Its Applications

Set stabilization is one of the essential problems in engineering systems, and self-triggered control(STC) can save the storage space for interactive information, and can be successfully applied in networked control systems with limited communication resources. In this study, the set stabilization problem and STC design of Boolean control networks are investigated via the semi-tensor product technique. On the one hand, the largest control invariant subset is calculated in terms of the strongly connected components of the state transition graph, by which a graph-theoretical condition for set stabilization is derived. On the other hand, a characteristic function is exploited to determine the triggering mechanism and feasible controls. Based on this, the minimum-time and minimum-triggering open-loop, state-feedback and output-feedback STCs for set stabilization are designed,respectively. As classic applications of self-triggered set stabilization, self-triggered synchronization, self-triggered output tracking and self-triggered output regulation are discussed as well. Additionally, several practical examples are given to illustrate the effectiveness of theoretical results.

Matching Algorithms of Minimum Input Selection for Structural Controllability Based on Semi-Tensor Product of Matrices

In 2011,Liu,et al.investigated the structural controllability of directed networks.They proved that the minimum number of input signals,driver nodes,can be determined by seeking a maximum matching in the directed network.Thus,the algorithm for seeking a maximum matching is the key to solving the structural controllability problem of directed networks.In this study,the authors provide algebraic expressions for matchings and maximum matchings proposed by Liu,et al.(2011)via a new matrix product called semi-tensor product,based on which the corresponding algorithms are established to seek matchings and maximum matchings in digraphs,which make determining the number of driver nodes tractable in computer.In addition,according to the proposed algorithm,the authors also construct an algorithm to distinguish critical arcs,redundant arcs and ordinary arcs of the directed network,which plays an important role in studying the robust control problem.An example of a small network from Liu’s paper is used for algorithm verification.

Modeling and reachability analysis of synchronizing transitions bounded Petri net systems based upon semi-tensor product of matrices

The reachability problem of synchronizing transitions bounded Petri net systems （BPNSs） is investigated in this paper by constructing a mathematical model for dynamics of BPNS. Using the semi-tensor product （STP） of matrices, the dynamics of BPNSs, which can be viewed as a combination of several small bounded subnets via synchronizing transitions, are described by an algebraic equation. When the algebraic form for its dynamics is established, we can present a necessary and sufficient condition for the reachability between any marking （or state） and initial marking. Also, we give a corresponding algorithm to calculate all of the transition paths between initial marking and any target marking. Finally, an example is shown to illustrate proposed results. The key advantage of our approach, in which the set of reachable markings of BPNSs can be expressed by the set of reachable markings of subnets such that the big reachability set of BPNSs do not need generate, is partly avoid the state explosion problem of Petri nets （PNs）.

Semi-tensor product approach to controllability and stabilizability of finite automata

Using semi-tensor product of matrices, the controllability and stabilizability of finite automata are investigated. By expressing the states, inputs, and outputs in vector forms, the transition and output functions are represented in matrix forms.Based on this algebraic description, a necessary and sufficient condition is proposed for checking whether a state is controllable to another one. By this condition, an algorithm is established to find all the control sequences of an arbitrary length. Moreover, the stabilizability of finite automata is considered, and a necessary and sufficient condition is presented to examine whether some states can be stabilized. Finally, the study of illustrative examples verifies the correctness of the presented results/algorithms.

A Matrix Approach to the Modeling and Analysis of Networked Evolutionary Games With Time Delays

Using the semi-tensor product method, this paper investigates the modeling and analysis of networked evolutionary games(NEGs) with finite memories, and presents a number of new results. Firstly, a kind of algebraic expression is formulated for the networked evolutionary games with finite memories, based on which the behavior of the corresponding evolutionary game is analyzed. Secondly, under a proper assumption, the existence of Nash equilibrium of the given networked evolutionary games is proved and a free-type strategy sequence is designed for the convergence to the Nash equilibrium. Finally, an illustrative example is worked out to support the obtained new results.

Semi-tensor product approach for partially symmetric games

In this paper,a criterion for the partially symmetric game(PSG)is derived by using the semitensor product approach.The dimension and the basis of the linear subspace composed of all the PSGs with respect to a given set of partial players are calculated.The testing equations with the minimum number are concretely determined,and the computational complexity is analysed.Finally,two examples are displayed to show the theoretical results.

ON THE OBSERVABILITY OF FREE BOOLEAN NETWORKS VIA THE SEMI-TENSOR PRODUCT METHOD

This paper investigates the observabihty of free Boolean networks by using the semi-tensor product method,and presents some new results.First,the concept of observability for free Boolean networks is proposed,based on which and the algebraic form of Boolean networks,a kind of observabihty matrix is constructed.Second,by the observability matrix,a new necessary and sufficient condition is given for the observability of Boolean networks.Third,the concept of observabihty index for observable Boolean networks is defined,and an algorithm is established to calculate the observability index.Finally,a practical example of D.Melanogaster segmentation polarity gene networks is studied to support our new results.The study of the illustrative example shows that the new results obtained in this paper are very effective in investigating the observability of free Boolean networks.

The Computation of Nash Equilibrium in Fashion Games via Semi-Tensor Product Method

Using the semi-tensor product of matrices, this paper investigates the computation of purestrategy Nash equilibrium （PNE） for fashion games, and presents several new results. First, a formal fashion game model on a social network is given. Second, the utility function of each player is converted into an Mgebraic form via the semi-tensor product of matrices, based on which the case of two-strategy fashion game is studied and two methods are obtained for the case to verify the existence of PNE. Third, the multi-strategy fashion game model is investigated and an algorithm is established to find all the PNEs for the general case. Finally, two kinds of optimization problems, that is, the so-called social welfare and normalized satisfaction degree optimization problems are investigated and two useful results are given. The study of several illustrative examples shows that the new results obtained in this paper are effective.

A Semi-Tensor Product Based All Solutions Boolean Satisfiability Solver

Boolean satisfiability (SAT) is widely used as a solver engine in electronic design automation (EDA). Typically, SAT is used to determine whether one or more groups of variables can be combined to form a true formula. All solutions SAT (AllSAT) is a variant of the SAT problem. In the fields of formal verification and pattern generation, AllSAT is particularly useful because it efficiently enumerates all possible solutions. In this paper, a semi-tensor product (STP) based AllSAT solver is proposed. The solver can solve instances described in both the conjunctive normal form (CNF) and circuit form. The implementation of our method differs from incremental enumeration because we do not add blocking conditions for existing solutions, but rather compute the matrices to obtain all the solutions in one pass. Additionally, the logical matrices support a variety of logic operations. Results from experiments with MCNC benchmarks using CNF-based and circuit-based forms show that our method can accelerate CPU time by 8.1x (238x maximum) and 19.9x (72x maximum), respectively.

Stability Analysis of Networked Evolutionary Games with Profile-Dependent Delays

This paper investigates the networked evolutionary games(NEGs)with profile-dependent delays,including modeling and stability analysis.Profile-dependent delay,which varies with the game profiles,slows the information transmission between participants.Firstly,the dynamics model is proposed for the profile-dependent delayed NEG,then the algebraic formulation is established using the algebraic state space approach.Secondly,the dynamic behavior of the game is discussed,involving general stability and evolutionarily stable profile analysis.Necessary and sufficient criteria are derived using the matrices,which can be easily verified by mathematical software.Finally,a numerical example is carried out to demonstrate the validity of the theoretical results.

Algebraic form and analysis of SIR epidemic dynamics over probabilistic dynamic networks

The outbreak of corona virus disease 2019 has profoundly affected people’s way of life.It is increasingly necessary to investigate epidemics over social networks.This paper studies susceptible-infected-removed(SIR)epidemics via the semi-tensor product.First,a formal susceptible-infected-removed epidemic dynamic model over probabilistic dynamic networks(SIRED-PDN)is given.Based on an evolutionary rule,the algebraic form for the dynamics of individual states and network topologies is given,respectively.Second,the SIRED-PDN can be described by a probabilistic mix-valued logical network.After providing an algorithm,all possible final spreading equilibria can be obtained for any given initial epidemic state and network topology by seeking attractors of the network.And the shortest time for all possible initial epidemic state and network topology profiles to evolve to the final spreading equilibria can be obtained by seeking the transient time of the network.Finally,an illustrative example is given to show the effectiveness of our model.

Controllability of Boolean control networks with multiple time delays in both states and controls

In this paper,the problem of controllability of Boolean control networks(BCNs)with multiple time delays in both states and controls is investigated.First,the controllability problem of BCNs with multiple time delays in controls is considered.For this controllability problem,a controllability matrix is constructed by defining a new product of matrices,based on which a necessary and sufficient controllability condition is obtained.Then,the controllability of BCNs with multiple time delays in states is studied by giving a necessary and sufficient condition.Subsequently,based on these results,a controllability matrix for BCNs with multiple time delays in both states and controls is proposed that provides a concise controllability condition.Finally,two examples are given to illustrate the main results.

Semi-tensor product approach to networked evolutionary games

In this paper a comprehensive introduction for modeling and control of networked evolutionary games （NEGs） via semi-tensor product （STP） approach is presented. First, we review the mathematical model of an NEG, which consists of three ingredients： network graph, fundamental network game, and strategy updating rule. Three kinds of network graphs are considered, which are i） undirected graph for symmetric games; ii） directed graph for asymmetric games, and iii） d-directed graph for symmetric games with partial neighborhood information. Three kinds of fundamental evolutionary games （FEGs） are discussed, which are i） two strategies and symmetric （S-2）; ii） two strategies and asymmetric （A-2）; and iii） three strategies and symmetric （S-3）. Three strategy updating rules （SUR） are introduced, which are i） Unconditional Imitation （UI）; ii） Fermi Rule（FR）; iii） Myopic Best Response Adjustment Rule （MBRA）. First, we review the fundamental evolutionary equation （FEE） and use it to construct network profile dynamics （NPD）of NEGs. To show how the dynamics of an NEG can be modeled as a discrete time dynamics within an algebraic state space, the fundamental evolutionary equation （FEE） of each player is discussed. Using FEEs, the network strategy profile dynamics （NSPD） is built by providing efficient algorithms. Finally, we consider three more complicated NEGs： i） NEG with different length historical information, ii） NEG with multi-species, and iii） NEG with time-varying payoffs. In all the cases, formulas are provided to construct the corresponding NSPDs. Using these NSPDs, certain properties are explored. Examples are presented to demonstrate the model constructing method, analysis and control design technique, and to reveal certain dynamic behaviors of NEGs.

Dynamics and Stability of Potential Hyper-networked Evolutionary Games

This paper considers the modeling and convergence of hyper-networked evolutionary games （HNEGs）. In an HNEG the network graph is a hypergraph, which allows the fundamental network game to be a multi-player one. Using semi-tensor product of matrices and the fundamental evolutionary equation, the dynamics of an HNEG is obtained and we extend the results about the networked evolutionary games to show whether an HNEG is potential and how to calculate the potential. Then we propose a new strategy updating rule, called the cascading myopic best response adjustment rule （MBRAR）, and prove that under the cascading MBRAR the strategies of an HNEG will converge to a pure Nash equilibrium. An example is presented and discussed in detail to demonstrate the theoretical and numerical results.

Simplification of Shapley value for cooperative games via minimum carrier

Shapley value is one of the most fundamental concepts in cooperative games.This paper investigates the calculation of the Shapley value for cooperative games and establishes a new formula via carrier.Firstly,a necessary and sufficient condition is presented for the verification of carrier,based on which an algorithm is worked out to find the unique minimum carrier.Secondly,by virtue of the properties of minimum carrier,it is proved that the profit allocated to dummy players(players which do not belong to the minimum carrier)is zero,and the profit allocated to players in minimum carrier is only determined by the minimum carrier.Then,a new formula of the Shapley value is presented,which greatly reduces the computational complexity of the original formula,and shows that the Shapley value only depends on the minimum carrier.Finally,based on the semi-tensor product(STP)of matrices,the obtained new formula is converted into an equivalent algebraic form,which makes the new formula convenient for calculation via MATLAB.

A matrix-based static approach to analysis of finite state machines

Traditional matrix-based approaches in the field of finite state machines construct state transition matrices,and then use the powers of the state transition matrices to represent corresponding dynamic transition processes,which are cornerstones of system analysis.In this study,we propose a static matrix-based approach that revisits a finite state machine from its structure rather than its dynamic transition process,thus avoiding the“explosion of complexity”problem inherent in the existing approaches.Based on the static approach,we reexamine the issues of closed-loop detection and controllability for deterministic finite state machines.In addition,we propose controllable equivalent form and minimal controllable equivalent form concepts and give corresponding algorithms.

A minimum adequate set of multi-valued logic

An adequate set of k-valued logic is provided,which contains only two operators.It is also proved that this adequate set is of minimum size。

State space optimization of finite state machines from the viewpoint of control theory

Motivated by the inconvenience or even inability to explain the mathematics of the state space optimization of finite state machines(FSMs)in most existing results,we consider the problem by viewing FSMs as logical dynamic systems.Borrowing ideas from the concept of equilibrium points of dynamic systems in control theory,the concepts of t-equivalent states and t-source equivalent states are introduced.Based on the state transition dynamic equations of FSMs proposed in recent years,several mathematical formulations of t-equivalent states and t-source equivalent states are proposed.These can be analogized to the necessary and sufficient conditions of equilibrium points of dynamic systems in control theory and thus give a mathematical explanation of the optimization problem.Using these mathematical formulations,two methods are designed to find all the t-equivalent states and t-source equivalent states of FSMs.Further,two ways of reducing the state space of FSMs are found.These can be implemented without computers but with only pen and paper in a mathematical manner.In addition,an open question is raised which can further improve these methods into unattended ones.Finally,the correctness and effectiveness of the proposed methods are verified by a practical language model.