Synchronization and stability for asynchronous temporal Boolean networks

Asynchronous temporal Boolean Networks (ATBNs) are more complex in structure and have different linear expressions compared to traditional synchronous Boolean networks. The complexity depends on the number of updated nodes. The main contribution of this paper is to propose results of synchronization and anti-synchronization problems of ATBNs. First, this paper abstracts two Temporal Boolean Networks (TBNs) into a mathematical model, and provides a linear expression of the network by means of the semi-tensor product (STP) tool. Second, based on the asynchronous updating scheme of temporal Boolean networks, we investigate the synchronization (including complete synchronization and anti-synchronization) of ATBNs, and provide two results to guarantee the synchronization and anti-synchronization. Finally, we provide two examples to verify the correctness of our theorems and corollaries.