Based on binary logic, this study presents a new framework to analyze the dynamics of Boolean control networks (BCNs) and investigates the basic problem of state-space approach without using the semi-tensor product (STP). The logical form of BCNs is transformed into a discrete-time bilinear system by resorting to Khatri-Rao product and Boolean minterms. This certainly reduces the computational efforts compared to the STP based method. Subspace and regular subspace of a Boolean state-space are defined for BCNs. Necessary and sufficient conditions for the existence of a regular subspace are presented. Further, a general procedure is given to obtain the logical coordinate transformation. On the same lines, output-friendly subspace is also defined. At last, suitable examples are given to illustrate the validity and benefits of the presented results, and application outlook of this framework.
Subspace and coordinate transformation for boolean control networks using binary logic / Sarda, K.; Yerudkar, A.; Del Vecchio, C.; Glielmo, L.; Singh, N.. - (2019), pp. 328-333. (Intervento presentato al convegno 27th Mediterranean Conference on Control and Automation, MED 2019 tenutosi a Palm Beach Hotel, isr nel 2019) [10.1109/MED.2019.8798562].
Subspace and coordinate transformation for boolean control networks using binary logic
Del Vecchio C.;Glielmo L.;
2019
Abstract
Based on binary logic, this study presents a new framework to analyze the dynamics of Boolean control networks (BCNs) and investigates the basic problem of state-space approach without using the semi-tensor product (STP). The logical form of BCNs is transformed into a discrete-time bilinear system by resorting to Khatri-Rao product and Boolean minterms. This certainly reduces the computational efforts compared to the STP based method. Subspace and regular subspace of a Boolean state-space are defined for BCNs. Necessary and sufficient conditions for the existence of a regular subspace are presented. Further, a general procedure is given to obtain the logical coordinate transformation. On the same lines, output-friendly subspace is also defined. At last, suitable examples are given to illustrate the validity and benefits of the presented results, and application outlook of this framework.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
