title: Observability of Automata Networks: Fixed and Switching Cases.
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.
authors.forename: Rui
authors.initials: R
authors.lastname: Li
authors.forename: Yiguang
authors.initials: Y
authors.lastname: Hong
authors.forename: Xingyuan
authors.initials: X
authors.lastname: Wang