Minimal control nodes for strong structural observability of discrete-time iterative systems: explicit formulas and polynomial-time algorithms
From MaRDI portal
Cited in
(11)- Input-output decoupling of probabilistic Boolean control networks
- Optimal state estimation of Boolean control networks under stochastic function perturbations
- Algebraic calculation for safety synthesis of networked logical finite state machines
- Stability analysis of compositional Boolean networks through different logical operators
- Necessary and sufficient conditions of controllability of networked SISO systems with nonidentical dimensional nodes
- Merging rules for strong structural controllability and minimum input problem in undirected networks
- Event-triggered output feedback stabilization of Boolean control networks via Ledley solution
- Parameter estimation of probabilistic Boolean control networks: an optimization-based approach
- Stability analysis for switched Boolean networks with minimum dwell time
- Robust state estimation in stochastic Boolean control networks: an enhanced auxiliary particle filtering framework with observation-guided process-noise adaptation
- Controllability and stabilization of switched Boolean control networks with periodic switching restrictions
This page was built for publication: Minimal control nodes for strong structural observability of discrete-time iterative systems: explicit formulas and polynomial-time algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575925)