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...Show MoreMetadata
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.
Published in: 2015 54th IEEE Conference on Decision and Control (CDC)
Date of Conference: 15-18 December 2015
Date Added to IEEE Xplore: 11 February 2016
ISBN Information:
