دانلود کتاب Analysis and control of Boolean networks: a semi-tensor product approach

فهرست مطالب :

Identification via Input-Output Data......Page 5
Vector Form of Random Boolean Variables......Page 9
References......Page 10
Realization......Page 14
Cover......Page 1
Some Examples......Page 8
Contents......Page 11
References......Page 18
References......Page 19
References......Page 23
Cascading Inference......Page 31
Multiple-Dimensional Data......Page 35
Identification via Input-State Data......Page 2
Matrix Expression of a Random Boolean Network......Page 12
First Algebraic Form of Higher Order Boolean Networks......Page 26
References......Page 34
Preface......Page 6
Statements......Page 17
Modeling via Data with Errors......Page 22
Adequate Sets of Connectives......Page 24
References......Page 37
Basic Functions......Page 3
Implication and Equivalence......Page 21
Notation......Page 15
References......Page 25
References......Page 16
Compounded Games......Page 7
Appendix B Proofs of Some Theorems Concerning the Semi-tensor Product......Page 13
Cycle Strategy......Page 4
Mix-valued Logic......Page 28
References......Page 33
References......Page 20
Normal Form......Page 27
Multivalued Logic......Page 30
Semi-tensor Product of Matrices......Page 45
Swap Matrix......Page 53
Properties of the Semi-tensor Product......Page 57
General Semi-tensor Product......Page 65
References......Page 69
Structure Matrix of a Logical Operator......Page 70
Structure Matrix for k-valued Logic......Page 74
Logical Matrices......Page 78
References......Page 80
Solution of a Logical Equation......Page 81
Equivalent Algebraic Equations......Page 82
Logical Inference......Page 92
Substitution......Page 98
k-valued Logical Equations......Page 99
Matrix Expression of Route Logic......Page 103
Failure Location......Page 106
Cascading Inference......Page 111
References......Page 114
Introduction to Boolean Networks......Page 116
Dynamics of Boolean Networks......Page 117
Fixed Points and Cycles......Page 121
Some Classical Examples......Page 132
Serial Boolean Networks......Page 137
Higher Order Boolean Networks......Page 139
First Algebraic Form of Higher Order Boolean Networks......Page 141
Second Algebraic Form of Higher Order Boolean Networks......Page 150
References......Page 152
Boolean Control Networks......Page 154
Semi-tensor Product Vector Space vs. Semi-tensor Product Space......Page 156
Cycles in Input-State Space......Page 159
Cascaded Boolean Networks......Page 164
Two Illustrative Examples......Page 167
References......Page 174
Reconstructing Networks......Page 175
Model Construction for General Networks......Page 183
Construction with Known Network Graph......Page 188
Least In-degree Model......Page 189
Construction of Uniform Boolean Network......Page 193
Modeling via Data with Errors......Page 196
References......Page 199
State Spaces of Boolean Networks......Page 200
Coordinate Transformation......Page 202
Regular Subspaces......Page 207
Invariant Subspaces......Page 215
Indistinct Rolling Gear Structure......Page 218
References......Page 223
Control via Input Boolean Network......Page 224
Subnetworks......Page 231
Controllability via Free Boolean Sequence......Page 233
Observability......Page 238
References......Page 242
What Is a Realization?......Page 243
Controllable Normal Form......Page 245
Observable Normal Form......Page 249
Kalman Decomposition......Page 252
Realization......Page 256
References......Page 258
Boolean Matrices......Page 259
Global Stability......Page 263
Stabilization of Boolean Control Networks......Page 271
References......Page 283
Problem Formulation......Page 284
Y-friendly Subspace......Page 285
Control Design......Page 292
Canalizing Boolean Mapping......Page 298
Solving DDPs via Constant Controls......Page 301
References......Page 304
Decomposition of Control Systems......Page 306
The Cascading State-space Decomposition Problem......Page 307
Comparable Regular Subspaces......Page 312
The Parallel State-space Decomposition Problem......Page 314
Input-Output Decomposition......Page 317
References......Page 320
A Review of k-valued Logic......Page 321
Dynamics of k-valued Networks......Page 324
State Space and Coordinate Transformations......Page 328
Cycles and Transient Period......Page 332
Network Reconstruction......Page 333
k-valued Control Networks......Page 338
Mix-valued Logic......Page 348
References......Page 353
Input-State Transfer Graphs......Page 354
Topological Structure of Logical Control Networks......Page 358
Optimal Control of Logical Control Networks......Page 363
Optimal Control of Higher-Order Logical Control Networks......Page 368
References......Page 376
The Input-State Incidence Matrix......Page 377
Controllability......Page 380
Trajectory Tracking and Control Design......Page 384
Observability......Page 385
Fixed Points and Cycles......Page 388
Mix-valued Logical Systems......Page 389
References......Page 394
What Is Identification?......Page 395
Identification via Input-State Data......Page 396
Identification via Input-Output Data......Page 399
General Algorithm......Page 402
Numerical Solution Based on Network Graph......Page 406
Identification of Higher-Order Systems......Page 409
Approximate Identification......Page 410
References......Page 413
Strategies with Finite Memory......Page 414
Cycle Strategy......Page 417
Compounded Games......Page 420
Sub-Nash Solution for Zero-Memory Strategies......Page 422
Nash Equilibrium for µ-Memory Strategies......Page 424
Common Nash (Sub-Nash) Solutions for µ-Memory Strategies......Page 426
References......Page 434
Markov Chains......Page 435
Vector Form of Random Boolean Variables......Page 443
Matrix Expression of a Random Boolean Network......Page 446
Some Topological Properties......Page 451
References......Page 454
Computation of Logical Matrices......Page 455
Basic Functions......Page 457
Some Examples......Page 462
Appendix B Proofs of Some Theorems Concerning the Semi-tensor Product......Page 467
References......Page 470
Index......Page 471