Ayuda
Ir al contenido

Dialnet


Redefined observability matrix for Boolean networks and distinguishable partitions of state space

  • Autores: Yuqian Guo, Weihua Gui, Chunhua Yang
  • Localización: Automatica: A journal of IFAC the International Federation of Automatic Control, ISSN 0005-1098, Vol. 91, 2018, págs. 316-319
  • Idioma: inglés
  • Texto completo no disponible (Saber más ...)
  • Resumen
    • This paper redefines the observability matrix and defines the observability index for Boolean networks (BNs). In the new definition, a BN is observable if and only if the observability matrix is of full rank. The observability matrix is calculated by a simple algorithm and is applied to the problem of distinguishability of partitions. A partition of the state space is said to be distinguishable if any two distinct subsets are distinguishable, and the finest distinguishable partition (FDP) is finer than any other distinguishable partition. A necessary and sufficient condition is proposed for checking the distinguishability of any given partition, and an algorithm is proposed for calculating the FDP. The proposed results are illustrated by examples.


Fundación Dialnet

Dialnet Plus

  • Más información sobre Dialnet Plus

Opciones de compartir

Opciones de entorno