Pages that link to "Item:Q2833528"
From MaRDI portal
The following pages link to A Weighted Pair Graph Representation for Reconstructibility of Boolean Control Networks (Q2833528):
Displaying 16 items.
- Detectability of Boolean networks with disturbance inputs (Q826778) (← links)
- Finite automata approach to observability of switched Boolean control networks (Q901271) (← links)
- Observability of Boolean control networks with time-variant delays in states (Q1621156) (← links)
- A matrix-based approach to verifying stability and synthesizing optimal stabilizing controllers for finite-state automata (Q1622234) (← links)
- Detectability verification of probabilistic Boolean networks (Q2056383) (← links)
- Detectability of labeled weighted automata over monoids (Q2081085) (← links)
- Synthesis for observability of logical control networks (Q2165980) (← links)
- On detectability of Boolean control networks (Q2178208) (← links)
- On detectability of labeled Petri nets and finite automata (Q2197590) (← links)
- Matrix approach to detectability of discrete event systems (Q2316509) (← links)
- On quotients of Boolean control networks (Q2663889) (← links)
- Bisimulations of Boolean Control Networks (Q4602534) (← links)
- A survey on observability of Boolean control networks (Q6063112) (← links)
- Robust minimal strong reconstructibility problem of Boolean control networks (Q6096343) (← links)
- Detectability of Boolean networks: a finite-time convergent matrix approach (Q6193219) (← links)
- Stabilization of continuous-time probabilistic logical networks under sampling dwell time constraints (Q6490234) (← links)
