Observability of Boolean Control Networks: A Unified Approach Based on Finite Automata
From MaRDI portal
Publication:2980437
Abstract: The problem on how to determine the observability of Boolean control networks (BCNs) has been open for five years already. In this paper, we propose a unified approach to determine all the four types of observability of BCNs in the literature. We define the concept of weighted pair graphs for BCNs. In the sense of each observability, we use the so-called weighted pair graph to transform a BCN to a finite automaton, and then we use the automaton to determine observability. In particular, the two types of observability that rely on initial states and inputs in the literature are determined. Finally, we show that no pairs of the four types of observability are equivalent, which reveals the essence of nonlinearity of BCNs.
Cited in
(52)- Minimal observability of Boolean control networks
- A note on observability of Boolean control networks
- Controllability of Markovian jump Boolean control networks
- On the stabilization of nondeterministic finite automata via static output feedback
- Reduced-order observer design for fault diagnosis of Boolean control networks
- Input-output dynamical stability analysis for cyber-physical systems via logical networks
- Minimum observability of probabilistic Boolean networks
- Robust invariant set analysis of Boolean networks
- Partial and global stabilization at an attractor for \(k\)-valued logical control networks
- Bisimulations of Boolean Control Networks
- On algorithms for state feedback stabilization of Boolean control networks
- On the static output feedback stabilisation of discrete event dynamic systems based upon the approach of semi-tensor product of matrices
- Observability of Boolean control networks with time-variant delays in states
- Finite-time observability of probabilistic Boolean control networks
- Opacity of discrete-event systems under nondeterministic observation mechanism
- Reconstructibility analysis and set-observer design for Boolean control networks
- Finite-time observability of probabilistic Boolean multiplex control networks.
- Fault detection and pinning control of Boolean networks
- On detectability of labeled Petri nets and finite automata
- Asymptotical feedback controllability of probabilistic logic control networks
- Relation coarsest partition method to observability of probabilistic Boolean networks
- On detectability of Boolean control networks
- Synthesis for observability of logical control networks
- Set reachability and observability of probabilistic Boolean networks
- Mean-square stability of discrete-time switched systems under modeled random switching
- An improved multiple‐state observer of Boolean control networks
- Modelling and strategy consensus for a class of networked evolutionary games
- On reconstructibility of switched Boolean control networks
- Reduction and analysis of Boolean control networks by bisimulation
- Set controllability of Markov jump switching Boolean control networks and its applications
- Modelling and strategy optimisation for a kind of networked evolutionary games with memories under the bankruptcy mechanism
- Optimal control of singular Boolean control networks via Ledley solution method
- Finite automata approach to observability of switched Boolean control networks
- Detectability verification of probabilistic Boolean networks
- A survey on observability of Boolean control networks
- Further results on observability verification of Boolean control networks
- Stabilization of probabilistic finite automata based on semi-tensor product of matrices
- Distributional observability of probabilistic Boolean networks
- Asymptotical feedback controllability of continuous-time probabilistic logic control networks
- Complex systems with impulsive effects and logical dynamics: a brief overview
- Observability of Boolean networks via set controllability approach
- Stability analysis of state-triggered impulsive Boolean networks based on a hybrid index model
- On identification of Boolean control networks
- Constrained set controllability of logical control networks with state constraints and its applications
- Generalized cluster synchronization of Boolean control networks with delays in both the states and the inputs
- Observability of Boolean networks via matrix equations
- Identification of a class of singular Boolean control networks
- Optimal output tracking of Boolean control networks
- Necessary and sufficient vertex partition conditions for input-output decoupling of Boolean control networks
- Controllability and observability of state-dependent switched Boolean control networks with input constraints
- Observability of switched Boolean control networks using algebraic forms
- Nonsingularity of Trivium-like cascade FSRs over finite fields via semi-tensor product
This page was built for publication: Observability of Boolean Control Networks: A Unified Approach Based on Finite Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980437)
