Pages that link to "Item:Q5223786"
From MaRDI portal
The following pages link to A Polynomial-Time Algorithm for Solving the Minimal Observability Problem in Conjunctive Boolean Networks (Q5223786):
Displaying 13 items.
- Complex systems with impulsive effects and logical dynamics: a brief overview (Q2057657) (← links)
- Finite-time pinning stabilization of Markovian jump Boolean networks (Q2200182) (← links)
- Distributional observability of probabilistic Boolean networks (Q2242932) (← links)
- On quotients of Boolean control networks (Q2663889) (← links)
- Minimal observability of Boolean control networks (Q2670732) (← links)
- Fault detection and pinning control of Boolean networks (Q2671867) (← links)
- Bisimulations of Probabilistic Boolean Networks (Q5103921) (← links)
- Reduction and Analysis of Boolean Control Networks by Bisimulation (Q5858102) (← links)
- A survey on observability of Boolean control networks (Q6063112) (← links)
- A polynomial-time criterion for stability of large-scale switched conjunctive Boolean networks (Q6537294) (← links)
- Minimum observability of probabilistic Boolean networks (Q6564949) (← links)
- Finite-time observability of probabilistic Boolean control networks (Q6580824) (← links)
- Data informativity for analysis and control design of Boolean control networks (Q6663102) (← links)
