2015 | OriginalPaper | Buchkapitel
On Observability of Automata Networks via Computational Algebra
verfasst von : Rui Li, Yiguang Hong
Erschienen in: Language and Automata Theory and Applications
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.