access icon free Regular subspaces and invariant subspaces of Boolean control networks

This study investigates some fundamental problems on regular subspaces and invariant subspaces of Boolean control networks. First, a new necessary and sufficient condition for regular subspaces is obtained, which exactly reveals the relationship between a regular subspace and its complementary subspaces. A new method to compute complementary subspaces is proposed. Second, invariant subspaces without the regularity presupposition are considered. Some necessary and sufficient conditions of invariant subspaces are given. Finally, two examples are given to illustrate the obtained theoretical results.

Inspec keywords: Boolean algebra; control system synthesis

Other keywords: regular subspaces; invariant subspaces; Boolean control network

Subjects: Control system analysis and synthesis methods; Algebra

References

    1. 1)
    2. 2)
    3. 3)
    4. 4)
    5. 5)
    6. 6)
    7. 7)
    8. 8)
    9. 9)
    10. 10)
    11. 11)
    12. 12)
      • 22. Zou, Y., Zhu, J.: ‘Decomposition with respect to outputs for Boolean control networks’, Proc. 19th World Congress of IFAC, Cape Town, South Africa, August 2014, pp. 1033110336.
    13. 13)
      • 11. Cheng, D., Qi, H., Li, Z.: ‘Analysis and control of Boolean networks: a semi-tensor product approach’ (Springer, London, 2011).
    14. 14)
    15. 15)
    16. 16)
    17. 17)
    18. 18)
    19. 19)
    20. 20)
    21. 21)
      • 24. Magnus, J.R., Neudecker, H.: ‘Matrix differential calculus with applications in statistics and econometrics’ (John Wiley Sons, 2007, 3rd edn.).
    22. 22)
    23. 23)
    24. 24)
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-cta.2015.0476
Loading

Related content

content/journals/10.1049/iet-cta.2015.0476
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading