| Dedication |
|
v | |
| Preface |
|
vii | |
|
|
|
xiii | |
|
|
|
xv | |
|
|
|
|
1 Introduction and Preliminaries |
|
|
3 | (8) |
|
1.1 Finite-Value Networks |
|
|
3 | (2) |
|
|
|
5 | (1) |
|
1.3 Semi-Tensor Product of Matrices |
|
|
6 | (5) |
|
|
|
11 | (30) |
|
2.1 Introduction to Boolean Networks |
|
|
11 | (1) |
|
2.2 Topological Structure of Boolean Networks |
|
|
12 | (3) |
|
2.3 Lyapunov-Based Stability Analysis |
|
|
15 | (7) |
|
2.4 Function Perturbation of Boolean Networks |
|
|
22 | (4) |
|
2.5 Feedback Stabilization of Boolean Control Networks |
|
|
26 | (5) |
|
2.6 Output Tracking of Boolean Control Networks |
|
|
31 | (10) |
|
2.6.1 Constant Reference Signal |
|
|
31 | (2) |
|
2.6.2 Time-Varying Reference Signal |
|
|
33 | (8) |
|
3 Mix-Valued Logical Networks |
|
|
41 | (24) |
|
3.1 Introduction to Mix-Valued Logical Networks |
|
|
41 | (1) |
|
3.2 Topological Structure of Mix-Valued Logical Networks |
|
|
42 | (3) |
|
3.3 Disturbance Decoupling of Mix-Valued Logical Control Networks |
|
|
45 | (11) |
|
3.3.1 Problem Formulation |
|
|
46 | (1) |
|
3.3.2 Y-Friendly Subspace |
|
|
46 | (4) |
|
|
|
50 | (3) |
|
3.3.4 An Illustrative Example |
|
|
53 | (3) |
|
3.4 General Expression of Pseudo Logical Function |
|
|
56 | (9) |
|
3.4.1 General Expression of Pseudo Logical Function |
|
|
57 | (2) |
|
3.4.2 General Expression of Pseudo Mix-Valued Logical Function |
|
|
59 | (3) |
|
3.4.3 An Illustrative Example |
|
|
62 | (3) |
|
4 Delayed Logical Networks |
|
|
65 | (24) |
|
4.1 Introduction to Delayed Logical Networks |
|
|
65 | (1) |
|
4.2 Topological Structure of Delayed Logical Networks |
|
|
66 | (6) |
|
4.3 Trajectory Controllability of Delayed Logical Control Networks |
|
|
72 | (10) |
|
4.4 Control Design for Output Tracking of Delayed Boolean Control Networks |
|
|
82 | (7) |
|
5 Switched Logical Networks |
|
|
89 | (40) |
|
5.1 Introduction to Switched Logical Networks |
|
|
89 | (1) |
|
5.2 Stability Analysis Via Switching-Point Reachability |
|
|
90 | (8) |
|
5.3 Controllability Analysis and Control Design with State and Input Constraints |
|
|
98 | (21) |
|
5.4 Disturbance Decoupling Controller Design |
|
|
119 | (10) |
|
6 Probabilistic Logical Networks |
|
|
129 | (36) |
|
6.1 Introduction to Probabilistic Logical Networks |
|
|
129 | (2) |
|
6.2 Controllability of Context-Sensitive Probabilistic Logical Control Networks |
|
|
131 | (9) |
|
6.2.1 An Algebraic Form for Context-sensitive Probabilistic MLCNs |
|
|
131 | (2) |
|
6.2.2 An Algebraic Form of Probabilistic MLCNs with Constraints |
|
|
133 | (1) |
|
6.2.3 Controllability of Probabilistic MLCNs with Constraints |
|
|
134 | (6) |
|
6.3 Optimal Control for Probabilistic Logical Control Networks |
|
|
140 | (8) |
|
6.3.1 Optimal Finite-Horizon Control of the Probabilistic Mix-Valued Logical Networks |
|
|
140 | (3) |
|
6.3.2 First-passage Model Based Optimal Control |
|
|
143 | (5) |
|
6.4 Output Tracking Control of Probabilistic Logical Control Networks |
|
|
148 | (17) |
|
|
|
|
7 Networked Evolutionary Games |
|
|
165 | (30) |
|
7.1 Introduction to Networked Evolutionary Games |
|
|
165 | (4) |
|
7.2 Algebraic Formulation of Networked Evolutionary Games |
|
|
169 | (7) |
|
7.3 Convergence Analysis of Networked Evolutionary Games |
|
|
176 | (8) |
|
7.4 Optimization of Networked Evolutionary Games |
|
|
184 | (11) |
|
8 Nonlinear Feedback Shift Registers |
|
|
195 | (20) |
|
8.1 Introduction to Shift Registers |
|
|
195 | (1) |
|
8.2 Analysis of Feedback Shift Registers Via Boolean Networks |
|
|
196 | (6) |
|
8.2.1 Construction of the Shortest NFSR for a given Nonperiodic Sequence |
|
|
196 | (2) |
|
8.2.2 Construction of the Shortest NFSR for a given Periodic Sequence |
|
|
198 | (1) |
|
8.2.3 Construction of Full-length n-NFSR |
|
|
199 | (1) |
|
8.2.4 Construction of More Full-Length n-NFSRs |
|
|
200 | (2) |
|
8.3 Analysis of Feedback Shift Registers Via Multi-Valued Logical Networks |
|
|
202 | (13) |
|
8.3.1 Nonsingularity of FSRs |
|
|
202 | (5) |
|
8.3.2 Number of Cycles for a Feedback Shift Register |
|
|
207 | (1) |
|
8.3.3 Cycle Decomposition and Synthesis for FSRs |
|
|
208 | (4) |
|
8.3.4 An Illustrative Example |
|
|
212 | (3) |
|
|
|
215 | (44) |
|
9.1 Introduction to Graph Theory |
|
|
215 | (1) |
|
9.2 Graph Maximum Stable Set and Coloring Problems |
|
|
216 | (19) |
|
9.3 Robust Graph Coloring Problem |
|
|
235 | (14) |
|
9.4 T-Coloring and List Coloring Problems |
|
|
249 | (10) |
|
|
|
249 | (4) |
|
9.4.2 List Coloring Problem |
|
|
253 | (6) |
|
|
|
259 | (16) |
|
10.1 Introduction to Finite-Field Networks |
|
|
259 | (1) |
|
10.2 Consensus of Finite-Field Networks with Switching Topologies and Linear Protocols |
|
|
260 | (5) |
|
10.3 Leader-Follower Consensus of Multi-Agent Systems over Finite Fields |
|
|
265 | (10) |
| Index |
|
275 | |