• DocumentCode
    3743718
  • Title

    Using the theories of finite automata and formal languages to determine observability of switched Boolean control networks

  • Author

    Kuize Zhang;Lijun Zhang;Lihua Xie;Zhe Jiang

  • Author_Institution
    College of Automation, Harbin Engineering University, 150001, China
  • fYear
    2015
  • Firstpage
    4214
  • Lastpage
    4219
  • Abstract
    In this paper, how to determine the observability of switched Boolean control networks (SBCNs) is investigated. First, a new concept of weighted pair graph for an SBCN is defined. Second, the weighted pair graph is used to transform an SBCN into a deterministic finite automaton (DFA). Lastly, the observability of the SBCN is tested by testing the completeness of the DFA. Based on these results, algorithms for determining the observability and the initial state are designed.
  • Keywords
    "Observability","Automata","Switches","Formal languages","Transforms","Controllability"
  • Publisher
    ieee
  • Conference_Titel
    Decision and Control (CDC), 2015 IEEE 54th Annual Conference on
  • Type

    conf

  • DOI
    10.1109/CDC.2015.7402876
  • Filename
    7402876
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3743718