Consistent stabilizability of switched Boolean networks
This paper investigates the consistent stabilizability of switched Boolean networks (SBNs) by using the semi-tensor product method, and presents a number of new results. First, an algebraic expression of SBNs is obtained by the semi-tensor product, based on which the consistent stabilizability is th...
Gespeichert in:
| Veröffentlicht in: | Neural networks 2013-10, Vol.46, p.183-189 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 189 |
|---|---|
| container_issue | |
| container_start_page | 183 |
| container_title | Neural networks |
| container_volume | 46 |
| creator | Li, Haitao Wang, Yuzhen |
| description | This paper investigates the consistent stabilizability of switched Boolean networks (SBNs) by using the semi-tensor product method, and presents a number of new results. First, an algebraic expression of SBNs is obtained by the semi-tensor product, based on which the consistent stabilizability is then studied for SBNs and some necessary and sufficient conditions are presented for the design of free-form and state-feedback switching signals, respectively. Finally, the consistent stabilizability of SBNs with state constraints is considered and some necessary and sufficient conditions are proposed. The study of illustrative examples shows that the new results obtained in this paper are very effective in designing switching signals for the consistent stabilizability of SBNs. |
| doi_str_mv | 10.1016/j.neunet.2013.05.012 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1671524530</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0893608013001627</els_id><sourcerecordid>1671524530</sourcerecordid><originalsourceid>FETCH-LOGICAL-c458t-6e13fd68c34488f1fec52ba528ddf727ae52f670ad87c136bb6726cdd43274423</originalsourceid><addsrcrecordid>eNqFkc1uFDEQhC0EIpvAGyA0FyQuM7T_nQsSrAhEipRLOFseuy28zI6D7SUKT59ZdoEbuXRfvqpuVRHyisJAgap3m2HG3YxtYED5AHIAyp6QFTX6vGfasKdkBeac9woMnJDTWjcAoIzgz8kJ49poqmFF9DrPNdWGc-tqc2Oa0q_fs913OXb1LjX_DUP3MecJ3dwtB-9y-V5fkGfRTRVfHvcZ-Xrx6Wb9pb-6_ny5_nDVeyFN6xVSHoMyngthTKQRvWSjk8yEEDXTDiWLSoMLRnvK1TgqzZQPQXCmhWD8jLw9-N6W_GOHtdltqh6nyc2Yd9VSpalkQnJ4HJWwRMEE54-jghmmKYBYUHFAfcm1Foz2tqStK_eWgt0XYTf2UITdF2FB2qWIRfb6eGE3bjH8Ff1JfgHeHAFXvZticbNP9R-ntWQU9kbvDxwuKf9MWGz1CWePIRX0zYac_v_JAwYgpuw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1428271004</pqid></control><display><type>article</type><title>Consistent stabilizability of switched Boolean networks</title><source>MEDLINE</source><source>Elsevier ScienceDirect Journals</source><creator>Li, Haitao ; Wang, Yuzhen</creator><creatorcontrib>Li, Haitao ; Wang, Yuzhen</creatorcontrib><description>This paper investigates the consistent stabilizability of switched Boolean networks (SBNs) by using the semi-tensor product method, and presents a number of new results. First, an algebraic expression of SBNs is obtained by the semi-tensor product, based on which the consistent stabilizability is then studied for SBNs and some necessary and sufficient conditions are presented for the design of free-form and state-feedback switching signals, respectively. Finally, the consistent stabilizability of SBNs with state constraints is considered and some necessary and sufficient conditions are proposed. The study of illustrative examples shows that the new results obtained in this paper are very effective in designing switching signals for the consistent stabilizability of SBNs.</description><identifier>ISSN: 0893-6080</identifier><identifier>EISSN: 1879-2782</identifier><identifier>DOI: 10.1016/j.neunet.2013.05.012</identifier><identifier>PMID: 23787170</identifier><language>eng</language><publisher>Kidlington: Elsevier Ltd</publisher><subject>Algebra ; Algorithms ; Applied sciences ; Boolean algebra ; Computer science; control theory; systems ; Consistent stabilizability ; Exact sciences and technology ; Feedback ; Information retrieval. Graph ; Models, Biological ; Networks ; Neural networks ; Neural Networks (Computer) ; Semi-tensor product ; State constraint ; Statistics as Topic - methods ; Switched Boolean network ; Switching ; Switching theory ; Theoretical computing</subject><ispartof>Neural networks, 2013-10, Vol.46, p.183-189</ispartof><rights>2013 Elsevier Ltd</rights><rights>2014 INIST-CNRS</rights><rights>Copyright © 2013 Elsevier Ltd. All rights reserved.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c458t-6e13fd68c34488f1fec52ba528ddf727ae52f670ad87c136bb6726cdd43274423</citedby><cites>FETCH-LOGICAL-c458t-6e13fd68c34488f1fec52ba528ddf727ae52f670ad87c136bb6726cdd43274423</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0893608013001627$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,27901,27902,65306</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=27752102$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/23787170$$D View this record in MEDLINE/PubMed$$Hfree_for_read</backlink></links><search><creatorcontrib>Li, Haitao</creatorcontrib><creatorcontrib>Wang, Yuzhen</creatorcontrib><title>Consistent stabilizability of switched Boolean networks</title><title>Neural networks</title><addtitle>Neural Netw</addtitle><description>This paper investigates the consistent stabilizability of switched Boolean networks (SBNs) by using the semi-tensor product method, and presents a number of new results. First, an algebraic expression of SBNs is obtained by the semi-tensor product, based on which the consistent stabilizability is then studied for SBNs and some necessary and sufficient conditions are presented for the design of free-form and state-feedback switching signals, respectively. Finally, the consistent stabilizability of SBNs with state constraints is considered and some necessary and sufficient conditions are proposed. The study of illustrative examples shows that the new results obtained in this paper are very effective in designing switching signals for the consistent stabilizability of SBNs.</description><subject>Algebra</subject><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Boolean algebra</subject><subject>Computer science; control theory; systems</subject><subject>Consistent stabilizability</subject><subject>Exact sciences and technology</subject><subject>Feedback</subject><subject>Information retrieval. Graph</subject><subject>Models, Biological</subject><subject>Networks</subject><subject>Neural networks</subject><subject>Neural Networks (Computer)</subject><subject>Semi-tensor product</subject><subject>State constraint</subject><subject>Statistics as Topic - methods</subject><subject>Switched Boolean network</subject><subject>Switching</subject><subject>Switching theory</subject><subject>Theoretical computing</subject><issn>0893-6080</issn><issn>1879-2782</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><sourceid>EIF</sourceid><recordid>eNqFkc1uFDEQhC0EIpvAGyA0FyQuM7T_nQsSrAhEipRLOFseuy28zI6D7SUKT59ZdoEbuXRfvqpuVRHyisJAgap3m2HG3YxtYED5AHIAyp6QFTX6vGfasKdkBeac9woMnJDTWjcAoIzgz8kJ49poqmFF9DrPNdWGc-tqc2Oa0q_fs913OXb1LjX_DUP3MecJ3dwtB-9y-V5fkGfRTRVfHvcZ-Xrx6Wb9pb-6_ny5_nDVeyFN6xVSHoMyngthTKQRvWSjk8yEEDXTDiWLSoMLRnvK1TgqzZQPQXCmhWD8jLw9-N6W_GOHtdltqh6nyc2Yd9VSpalkQnJ4HJWwRMEE54-jghmmKYBYUHFAfcm1Foz2tqStK_eWgt0XYTf2UITdF2FB2qWIRfb6eGE3bjH8Ff1JfgHeHAFXvZticbNP9R-ntWQU9kbvDxwuKf9MWGz1CWePIRX0zYac_v_JAwYgpuw</recordid><startdate>20131001</startdate><enddate>20131001</enddate><creator>Li, Haitao</creator><creator>Wang, Yuzhen</creator><general>Elsevier Ltd</general><general>Elsevier</general><scope>IQODW</scope><scope>CGR</scope><scope>CUY</scope><scope>CVF</scope><scope>ECM</scope><scope>EIF</scope><scope>NPM</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7X8</scope><scope>7TK</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20131001</creationdate><title>Consistent stabilizability of switched Boolean networks</title><author>Li, Haitao ; Wang, Yuzhen</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c458t-6e13fd68c34488f1fec52ba528ddf727ae52f670ad87c136bb6726cdd43274423</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Algebra</topic><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Boolean algebra</topic><topic>Computer science; control theory; systems</topic><topic>Consistent stabilizability</topic><topic>Exact sciences and technology</topic><topic>Feedback</topic><topic>Information retrieval. Graph</topic><topic>Models, Biological</topic><topic>Networks</topic><topic>Neural networks</topic><topic>Neural Networks (Computer)</topic><topic>Semi-tensor product</topic><topic>State constraint</topic><topic>Statistics as Topic - methods</topic><topic>Switched Boolean network</topic><topic>Switching</topic><topic>Switching theory</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Li, Haitao</creatorcontrib><creatorcontrib>Wang, Yuzhen</creatorcontrib><collection>Pascal-Francis</collection><collection>Medline</collection><collection>MEDLINE</collection><collection>MEDLINE (Ovid)</collection><collection>MEDLINE</collection><collection>MEDLINE</collection><collection>PubMed</collection><collection>CrossRef</collection><collection>MEDLINE - Academic</collection><collection>Neurosciences Abstracts</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Neural networks</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Li, Haitao</au><au>Wang, Yuzhen</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Consistent stabilizability of switched Boolean networks</atitle><jtitle>Neural networks</jtitle><addtitle>Neural Netw</addtitle><date>2013-10-01</date><risdate>2013</risdate><volume>46</volume><spage>183</spage><epage>189</epage><pages>183-189</pages><issn>0893-6080</issn><eissn>1879-2782</eissn><abstract>This paper investigates the consistent stabilizability of switched Boolean networks (SBNs) by using the semi-tensor product method, and presents a number of new results. First, an algebraic expression of SBNs is obtained by the semi-tensor product, based on which the consistent stabilizability is then studied for SBNs and some necessary and sufficient conditions are presented for the design of free-form and state-feedback switching signals, respectively. Finally, the consistent stabilizability of SBNs with state constraints is considered and some necessary and sufficient conditions are proposed. The study of illustrative examples shows that the new results obtained in this paper are very effective in designing switching signals for the consistent stabilizability of SBNs.</abstract><cop>Kidlington</cop><pub>Elsevier Ltd</pub><pmid>23787170</pmid><doi>10.1016/j.neunet.2013.05.012</doi><tpages>7</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0893-6080 |
| ispartof | Neural networks, 2013-10, Vol.46, p.183-189 |
| issn | 0893-6080 1879-2782 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1671524530 |
| source | MEDLINE; Elsevier ScienceDirect Journals |
| subjects | Algebra Algorithms Applied sciences Boolean algebra Computer science control theory systems Consistent stabilizability Exact sciences and technology Feedback Information retrieval. Graph Models, Biological Networks Neural networks Neural Networks (Computer) Semi-tensor product State constraint Statistics as Topic - methods Switched Boolean network Switching Switching theory Theoretical computing |
| title | Consistent stabilizability of switched Boolean networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-11T02%3A22%3A19IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Consistent%20stabilizability%20of%20switched%20Boolean%20networks&rft.jtitle=Neural%20networks&rft.au=Li,%20Haitao&rft.date=2013-10-01&rft.volume=46&rft.spage=183&rft.epage=189&rft.pages=183-189&rft.issn=0893-6080&rft.eissn=1879-2782&rft_id=info:doi/10.1016/j.neunet.2013.05.012&rft_dat=%3Cproquest_cross%3E1671524530%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1428271004&rft_id=info:pmid/23787170&rft_els_id=S0893608013001627&rfr_iscdi=true |