Some results on the unramified principal series of p-adic groups.
This paper investigates the finite-time observability of probabilistic Boolean multiplex control networks (PBMCNs). Firstly, the finite-time observability of the PBMCNs is converted into the set reachability issue according to the parallel interconnection technique (a minor modification of the weighted pair graph method in the literature). Secondly, the necessary and sufficient condition for the finite-time observability of PBMCNs is presented based on the set reachability. Finally, the main conclusions...
Page 1