For access to this article, please select a purchase option:
IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.
Your recommendation has been sent to your librarian.
In this paper, the parallel decomposition problem of Boolean control networks (BCNs) is investigated by using graph theory method. Necessary and sufficient vertex partition conditions for the parallel decomposition of BCNs are obtained, under which logical coordinate transformations can be constructed to realize the parallel decomposition. Finally, an illustrative example is provided to validate the obtained theoretical results.
Inspec keywords: Boolean algebra; matrix decomposition; network theory (graphs); graph theory
Subjects: Algebra, set theory, and graph theory; Algebra; Combinatorial mathematics; Algebra; Combinatorial mathematics; Combinatorial mathematics; Algebra