Minimal observability of Boolean control networks (Q2670732)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7535812
Language Label Description Also known as
default for all languages
No label defined
    English
    Minimal observability of Boolean control networks
    scientific article; zbMATH DE number 7535812

      Statements

      Minimal observability of Boolean control networks (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      1 June 2022
      0 references
      The minimum observability of Boolean control networks (BCNs) is investigated in this paper. It is interesting and necessary to investigate the minimal observability problem for BCNs. The following three problems are solved: (1) whether a given system is observable; (2) how to design sensors to make a system observable; (3) how to obtain the minimum number of nodes that are needed to be observed directly, such that the resulted system is observable. The contribution of this paper is as follows: (i) A graphic approach is proposed to determine the observability of BCNs, followed by an algorithm to search for the set of key supernodes. (ii) All the available schemes (including the optimal scheme) of designing direct sensors can be obtained by solving certain equations. (iii) The minimal number of directly measured nodes can be found by solving a minimum set covering the problem. In all, the paper is valuable and well organized.
      0 references
      Boolean control networks
      0 references
      minimal observability
      0 references
      semi-tensor product
      0 references
      digraphs
      0 references
      key supernodes
      0 references

      Identifiers