Set stability of switched delayed logical networks with application to finite-field consensus
Authors:
- Yalu LiYLYalu Li
- Haitao LiHLHaitao Li
- Xueying DingXDXueying Ding
- 1 March 2020
- journal article
- research article
- Published by Elsevier in Automatica
- Vol. 113
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (61873150)
- National Natural Science Foundation of China (61503225)
This publication has 38 references indexed in Scilit:
- Stability Analysis for Switched Boolean Networks Under Arbitrary Switching SignalsIEEE Transactions on Automatic Control, 2014
- Optimal Control of Boolean Control NetworksIEEE Transactions on Automatic Control, 2013
- Continuous-time and sampled-data-based average consensus with logarithmic quantizersAutomatica, 2013
- On the robust synthesis of logical consensus algorithms for distributed intrusion detectionAutomatica, 2013
- Matrix Approach to Model Matching of Asynchronous Sequential MachinesIEEE Transactions on Automatic Control, 2013
- Boolean-controlled systems via receding horizon and linear programingMathematics of Control, Signals, and Systems, 2009
- Average consensus in networks of dynamic agents with switching topologies and multiple time-varying delaysSystems & Control Letters, 2008
- Control of Boolean networks: Hardness results and algorithms for tree structured networksJournal of Theoretical Biology, 2007
- Consensus Problems in Networks of Agents With Switching Topology and Time-DelaysIEEE Transactions on Automatic Control, 2004
- Metabolic stability and epigenesis in randomly constructed genetic netsJournal of Theoretical Biology, 1969