Abstract

This paper investigates the finite-time output-feedback set stabilization problem for probabilistic Boolean control networks (PBCNs), a crucial aspect of set convergence. Firstly, an algorithm is presented to effectively identify the largest output-feedback control invariant subset in a given set. Next, a sufficient condition is put forward to bridge set stabilization and the question at hand via the minimum transient period. Additionally, sufficient and necessary criteria are proposed, addressing the solvability of finite-time output-feedback set stabilization, followed by two corresponding algorithms for effectively designing all feasible output-feedback stabilizers. Finally, a biological example is successfully explored to demonstrate our theoretical results.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call