Indexed by:Journal Article

Date of Publication:2018-04-01

Journal:IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS

Included Journals:Scopus、EI、SCIE

Volume:29

Issue:4

Page Number:1388-1394

ISSN:2162-237X

Key Words:Automata networks; conjugacy; observability; recurrent neural networks; switched systems

Abstract: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.