Observability of Automata Networks: Fixed and Switching Cases
文献类型:期刊论文
作者 | Li, Rui1; Hong, Yiguang2![]() |
刊名 | IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS
![]() |
出版日期 | 2018-04-01 |
卷号 | 29期号:4页码:1388-1394 |
关键词 | Automata networks conjugacy observability recurrent neural networks switched systems |
ISSN号 | 2162-237X |
DOI | 10.1109/TNNLS.2017.2651053 |
英文摘要 | Automata networks are a class of fully discrete dynamical systems, which have received considerable interest in various different areas. This brief addresses the observability of automata networks and switched automata networks in a unified framework, and proposes simple necessary and sufficient conditions for observability. The results are achieved by employing methods from symbolic computation, and are suited for implementation using computer algebra systems. Several examples are presented to demonstrate the application of the results. |
WOS研究方向 | Computer Science ; Engineering |
语种 | 英语 |
WOS记录号 | WOS:000427859600053 |
出版者 | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC |
源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/29800] ![]() |
专题 | 系统科学研究所 |
通讯作者 | Li, Rui |
作者单位 | 1.Dalian Univ Technol, Sch Math Sci, Dalian 116024, Peoples R China 2.Chinese Acad Sci, Inst Syst Sci, Key Lab Syst & Control, Beijing 100190, Peoples R China 3.Dalian Univ Technol, Fac Elect Informat & Elect Engn, Dalian 116024, Peoples R China |
推荐引用方式 GB/T 7714 | Li, Rui,Hong, Yiguang,Wang, Xingyuan. Observability of Automata Networks: Fixed and Switching Cases[J]. IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS,2018,29(4):1388-1394. |
APA | Li, Rui,Hong, Yiguang,&Wang, Xingyuan.(2018).Observability of Automata Networks: Fixed and Switching Cases.IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS,29(4),1388-1394. |
MLA | Li, Rui,et al."Observability of Automata Networks: Fixed and Switching Cases".IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS 29.4(2018):1388-1394. |
入库方式: OAI收割
来源:数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。