On Observability of Automata Networks via Computational Algebra

摘要

Automata networks have been successfully used as abstract modeling schemes in many different fields. This paper deals with the observability of automata networks, which describes the ability to uniquely infer the network's initial configuration by measuring its output sequence. Simple necessary and sufficient conditions for observability are given. The results employ techniques from symbolic computation and can be easily implemented within the computer algebra environments. Two examples are worked out to illustrate the application of the results.