Cover -- Half title -- Title -- Copyright -- Dedication -- Preface -- Contents -- List of Figures -- List of Tables -- Part I Theory -- Chapter 1 Introduction and Preliminaries -- 1.1 Finite-Value Networks -- 1.2 Notations -- 1.3 Semi-Tensor Product of Matrices -- Chapter 2 Boolean Networks -- 2.1 Introduction to Boolean Networks -- 2.2 Topological Structure of Boolean Networks -- 2.3 Lyapunov-Based Stability Analysis -- 2.4 Function Perturbation of Boolean Networks -- 2.5 Feedback Stabilization of Boolean Control Networks -- 2.6 Output Tracking of Boolean Control Networks -- 2.6.1 Constant Reference Signal -- 2.6.2 Time-Varying Reference Signal -- Chapter 3 Mix-Valued Logical Networks -- 3.1 Introduction to Mix-Valued Logical Networks -- 3.2 Topological Structure of Mix-Valued Logical Networks -- 3.3 Disturbance Decoupling of Mix-Valued Logical Control Networks -- 3.3.1 Problem Formulation -- 3.3.2 Y-Friendly Subspace -- 3.3.3 Control Design -- 3.3.4 An Illustrative Example -- 3.4 General Expression of Pseudo Logical Function -- 3.4.1 General Expression of Pseudo Logical Function -- 3.4.2 General Expression of Pseudo Mix-Valued Logical Function -- 3.4.3 An Illustrative Example -- Chapter 4 Delayed Logical Networks -- 4.1 Introduction to Delayed Logical Networks -- 4.2 Topological Structure of Delayed Logical Networks -- 4.3 Trajectory Controllability of Delayed Logical Control Networks -- 4.4 Control Design for Output Tracking of Delayed Boolean -- Chapter 5 Switched Logical Networks -- 5.1 Introduction to Switched Logical Networks -- 5.2 Stability Analysis Via Switching-Point Reachability -- 5.3 Controllability Analysis and Control Design with State -- and Input Constraints 5.4 Disturbance Decoupling Controller Design -- Chapter 6 Probabilistic Logical Networks -- 6.1 Introduction to Probabilistic Logical Networks
6.2 Controllability of Context-Sensitive Probabilistic Logical -- Control Networks 6.2.1 An Algebraic Form for Context-sensitive -- Probabilistic MLCNs 6.2.2 An Algebraic Form of Probabilistic MLCNs -- with Constraints 6.2.3 Controllability of Probabilistic MLCNs with Constraints -- 6.3 Optimal Control for Probabilistic Logical Control Networks -- 6.3.1 Optimal Finite-Horizon Control of the Probabilistic -- Mix-Valued Logical Networks 6.3.2 First-passage Model Based Optimal Control -- 6.4 Output Tracking Control of Probabilistic Logical -- Part IIApplications -- Chapter 7 Networked Evolutionary Games -- 7.1 Introduction to Networked Evolutionary Games -- 7.2 Algebraic Formulation of Networked Evolutionary Games -- 7.3 Convergence Analysis of Networked Evolutionary Games -- 7.4 Optimization of Networked Evolutionary Games -- Chapter 8 Nonlinear Feedback Shift Registers -- 8.1 Introduction to Shift Registers -- 8.2 Analysis of Feedback Shift Registers Via Boolean Networks -- 8.2.1 Construction of the Shortest NFSR for a given -- Nonperiodic Sequence 8.2.2 Construction of the Shortest NFSR for a given -- Periodic Sequence 8.2.3 Construction of Full-length n-NFSR -- 8.2.4 Construction of More Full-Length n-NFSRs -- 8.3 Analysis of Feedback Shift Registers Via Multi-Valued -- Logical Networks 8.3.1 Nonsingularity of FSRs -- 8.3.2 Number of Cycles for a Feedback Shift Register -- 8.3.3 Cycle Decomposition and Synthesis for FSRs -- 8.3.4 An Illustrative Example -- Chapter 9 Graph Theory -- 9.1 Introduction to Graph Theory -- 9.2 Graph Maximum Stable Set and Coloring Problems -- 9.3 Robust Graph Coloring Problem -- 9.4 T-Coloring and List Coloring Problems -- 9.4.1 T-Coloring Problem -- 9.4.2 List Coloring Problem -- Chapter 10 Finite-Field Networks -- 10.1 Introduction to Finite-Field Networks -- 10.2 Consensus of Finite-Field Networks with Switching
Topologies and Linear Protocols 10.3 Leader-Follower Consensus of Multi-Agent Systems -- Index
