Back to Search
Start Over
Finite automata approach to reconstructibility of switched Boolean control networks.
- Source :
-
Neurocomputing . Sep2021, Vol. 454, p34-44. 11p. - Publication Year :
- 2021
-
Abstract
- This paper investigates the reconstructibility of switched Boolean control networks (SBCNs). Several new types of definition about reconstructibility are proposed where the existence and arbitrariness of the switching signal and the input sequence are inconsistent. A weighted pair graph describing all pairs of states which are indistinguished is defined. A deterministic finite automata method is applied into the reconstructibility analysis. Accordingly, several algorithms are designed to determine these types of reconstructibility. Moreover, for a given reconstructible SBCN, an algorithm for determining the current state is provided. Finally, an example is provided to demonstrate the effectiveness of the proposed algorithms and results. [ABSTRACT FROM AUTHOR]
- Subjects :
- *FINITE state machines
*WEIGHTED graphs
*ALGORITHMS
Subjects
Details
- Language :
- English
- ISSN :
- 09252312
- Volume :
- 454
- Database :
- Academic Search Index
- Journal :
- Neurocomputing
- Publication Type :
- Academic Journal
- Accession number :
- 151266059
- Full Text :
- https://doi.org/10.1016/j.neucom.2021.05.019