IDEAS home Printed from https://ideas.repec.org/a/taf/tsysxx/v53y2022i14p2935-2947.html
   My bibliography  Save this article

Finite-time sampled-data set stabilisation of delayed probabilistic Boolean control networks

Author

Listed:
  • Xiangshan Kong
  • Haitao Li

Abstract

In this paper, the finite-time constrained set stabilisation of delayed probabilistic Boolean control networks (DPBCNs) is considered via sampled-data control (SDC). The main mathematical tool is semi-tensor product of matrices, which is used to convert the dynamics of DPBCNs into an equivalent algebraic state space representation (ASSR). Based on the ASSR of DPBCNs, the constrained sampled-data transition probability matrix is constructed. Then, new criteria are proposed for the finite-time constrained reachability of DPBCNs under uniform SDC. By virtue of finite-time constrained reachability, a procedure is established to design state feedback sampled-data stabilisers for DPBCNs. The obtained results are applied to the ‘minimal’ model of lactose operon in E. coli.

Suggested Citation

  • Xiangshan Kong & Haitao Li, 2022. "Finite-time sampled-data set stabilisation of delayed probabilistic Boolean control networks," International Journal of Systems Science, Taylor & Francis Journals, vol. 53(14), pages 2935-2947, October.
    • Handle: RePEc:taf:tsysxx:v:53:y:2022:i:14:p:2935-2947
    DOI: 10.1080/00207721.2022.2065706
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2022.2065706
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207721.2022.2065706?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Li, Xi & Liu, Yang & Lou, Jungang & Lu, Jianquan, 2023. "Robust minimal strong reconstructibility problem of Boolean control networks," Applied Mathematics and Computation, Elsevier, vol. 458(C).

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tsysxx:v:53:y:2022:i:14:p:2935-2947. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TSYS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.