Paper Info
Title
Complete synchronization of temporal Boolean networks.
Abstract
This letter studies complete synchronization of two temporal Boolean networks coupled in the drive-response configuration. Necessary and sufficient conditions are provided based on the algebraic representation of Boolean networks. Moreover, the upper bound to check the criterion is given. Finally, an illustrative example shows the efficiency of the proposed results.
Year
DOI
Venue
2013
10.1016/j.neunet.2013.03.009
Neural Networks
Keywords
Field
DocType
Temporal Boolean network,Time delay,Complete synchronization,Semi-tensor product
Maximum satisfiability problem,Boolean function,Boolean network,Mathematical optimization,Boolean circuit,Algorithm,Theoretical computer science,Standard Boolean model,Boolean expression,And-inverter graph,Circuit minimization for Boolean functions,Mathematics
Journal
Volume
Issue
ISSN
44
null
0893-6080
Citations 
PageRank 
References 
17
0.76
17
Authors
2
Name
Order
Citations
PageRank
Fangfei Li1170.76
Xiwen Lu218221.03