Tiantian Mu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Tiantian Mu has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Jun-E Feng
School of Mathematics, Shandong University, Jinan, China
5 shared publications - Biao Wang
Shandong University
4 shared publications - Shuqian Zhu
School of Mathematics, Shandong University, Jinan, China
1 shared publication - Yanjun Cui
Department of Computer Science, Dartmouth College, Hanover, USA
1 shared publication - Yiliang Li
School of Mathematics, Shandong University, Jinan, China
1 shared publication - Yingzhe Jia
The School of Control Science and Engineering, Shandong University, Jinan, Shandong, People’s Republic of China
1 shared publication
Latest Publications
- 10 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 55 (7) , 4523-4533
Pinning Control for Local Synchronization of Drive-Response Boolean Networks
A pinning control strategy for the local synchronization of drive-response Boolean networks is proposed in this article. A necessary and sufficient condition of the local synchronization is given, along with the maximum initial state set guaranteeing the synchronization. A procedure for determining pinning nodes with the minimum number and designing a state feedback for each pinning node, leading to a local synchronous drive-response Boolean network, is provided. Finally, a gene regulation network for the D. melanogaster segmentation polarity is elaborated to illustrate the effectiveness of the proposed results.
- 10 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 55 (7) , 4523-4533
Pinning Control for Local Synchronization of Drive-Response Boolean Networks
A pinning control strategy for the local synchronization of drive-response Boolean networks is proposed in this article. A necessary and sufficient condition of the local synchronization is given, along with the maximum initial state set guaranteeing the synchronization. A procedure for determining pinning nodes with the minimum number and designing a state feedback for each pinning node, leading to a local synchronous drive-response Boolean network, is provided. Finally, a gene regulation network for the D. melanogaster segmentation polarity is elaborated to illustrate the effectiveness of the proposed results.
- 7 February 2025
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 496
Set stabilization of Boolean control networks based on bisimulations: A dimensionality reduction approach
- 7 February 2025
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 496
Set stabilization of Boolean control networks based on bisimulations: A dimensionality reduction approach
- 16 October 2023
- Published by Elsevier in ISA Transactions
- Vol. 144, 113-123
Identification of Boolean control networks with time delay
- 16 October 2023
- Published by Elsevier in ISA Transactions
- Vol. 144, 113-123
Identification of Boolean control networks with time delay
- 29 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 10 (2) , 865-874
Delay Synchronization of Drive-Response Boolean Networks and Boolean Control Networks
This article investigates the delay synchronization of drive Boolean network (DBN) and response BN (RBN) [response Boolean control network (RBCN)]. Synchronization and time delay are two common phenomena in real life. In aircraft formation, the latter's trajectory is consistent with the former's, but there exists a time gap when they arrive at the same position, which illustrates that time delay can happen in the process of synchronization. According to the delay step depending on initial states or not, two types of delay synchronization are proposed: 1) weak and 2) strong delay synchronization. Compared with synchronization, delay synchronization is only the theoretical generalization and has different application fields. Using the results of limit sets, several criteria for delay synchronization of the DBN and RBN are derived. This article provides an important result that delay synchronization of the DBN and RBCN can be equivalent to set stabilization of the augmented BCN, then the necessary and sufficient conditions are obtained. Moreover, two algorithms are established to design all time-optimal state feedback controllers. Finally, two examples are shown to demonstrate the effectiveness of the results.
- 29 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 10 (2) , 865-874
Delay Synchronization of Drive-Response Boolean Networks and Boolean Control Networks
This article investigates the delay synchronization of drive Boolean network (DBN) and response BN (RBN) [response Boolean control network (RBCN)]. Synchronization and time delay are two common phenomena in real life. In aircraft formation, the latter's trajectory is consistent with the former's, but there exists a time gap when they arrive at the same position, which illustrates that time delay can happen in the process of synchronization. According to the delay step depending on initial states or not, two types of delay synchronization are proposed: 1) weak and 2) strong delay synchronization. Compared with synchronization, delay synchronization is only the theoretical generalization and has different application fields. Using the results of limit sets, several criteria for delay synchronization of the DBN and RBN are derived. This article provides an important result that delay synchronization of the DBN and RBCN can be equivalent to set stabilization of the augmented BCN, then the necessary and sufficient conditions are obtained. Moreover, two algorithms are established to design all time-optimal state feedback controllers. Finally, two examples are shown to demonstrate the effectiveness of the results.
- 1 January 2022
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems - S
- Vol. 15 (11) , 3275-3296
Pinning detectability of Boolean control networks with injection mode
This technical note presents analytical investigations on detectability of Boolean network with pinning control and injection mode (BNPCIM). Detectability represents the property to uniquely determine the current state of the system according to known input-output sequences. Using Cheng product of matrices, BNPCIM can be converted into a special algebraic form of BCNs with mix-valued logical control. Based on different research requirements, three types of detectability for BNPCIM are proposed: weak detectability, detectability and strong detectability. Under free and networked input conditions, a sequence of matrices are constructed to reflect output and state information by explicit forms. Then by using the established matrices, several necessary and sufficient conditions for three types of detectability are derived. Moreover, to avoid unnecessary calculations, the maximum steps to achieve different detectability are gained. Finally, two illustrative examples are given to demonstrate the effectiveness of the obtained results.
- 1 January 2022
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems - S
- Vol. 15 (11) , 3275-3296
Pinning detectability of Boolean control networks with injection mode
This technical note presents analytical investigations on detectability of Boolean network with pinning control and injection mode (BNPCIM). Detectability represents the property to uniquely determine the current state of the system according to known input-output sequences. Using Cheng product of matrices, BNPCIM can be converted into a special algebraic form of BCNs with mix-valued logical control. Based on different research requirements, three types of detectability for BNPCIM are proposed: weak detectability, detectability and strong detectability. Under free and networked input conditions, a sequence of matrices are constructed to reflect output and state information by explicit forms. Then by using the established matrices, several necessary and sufficient conditions for three types of detectability are derived. Moreover, to avoid unnecessary calculations, the maximum steps to achieve different detectability are gained. Finally, two illustrative examples are given to demonstrate the effectiveness of the obtained results.