DocumentCode
176665
Title
Revisiting singular Boolean networks
Author
Min Meng ; Jun-e Feng
Author_Institution
Sch. of Math., Shandong Univ., Jinan, China
fYear
2014
fDate
May 31 2014-June 2 2014
Firstpage
3651
Lastpage
3656
Abstract
The general singular Boolean networks (SBNs) are proposed in this paper according to the algebraic form of dynamic-algebraic Boolean networks. First, the solvability theorems of this kind SBNs are presented. Then, the transition matrix of an SBN is defined, based on which the results on fixed points and cycles of SBNs are obtained. Furthermore, general singular Boolean control networks (SBCNs) are discussed, as well as the solvability of SBCNs. Several examples illustrate the feasibility of the theoretical results.
Keywords
Boolean algebra; computability; matrix algebra; SBCN solvability; SBN; algebraic form; dynamic-algebraic Boolean networks; general singular Boolean control networks; solvability theorem; transition matrix; Biological system modeling; Educational institutions; Manganese; Matrix converters; Power system stability; Standards; Vectors; Semi-tensor product; Singular Boolean networks; Solvability theorem; Transition matrix;
fLanguage
English
Publisher
ieee
Conference_Titel
Control and Decision Conference (2014 CCDC), The 26th Chinese
Conference_Location
Changsha
Print_ISBN
978-1-4799-3707-3
Type
conf
DOI
10.1109/CCDC.2014.6852814
Filename
6852814
Link To Document