Reachability of higher-order logical control networks via matrix method

Yunlei Zou and Jiandong Zhu

Applied Mathematics and Computation, 2016, vol. 287-288, 50-59

Abstract: This paper investigates the reachability of higher-order logical control networks. First, with semi-tensor product method, the matrix expression of a higher-order logical control network is given. Then, a partitioned matrix is constructed, which intuitively shows the input-state mapping information. With this matrix, some conditions are obtained for the reachability of higher-order logical control networks. Finally, an algorithm is designed to find control sequences that drive a given initial state to a given destination state.

Keywords: Semi-tensor product; Higher-order logical control network; Reachability; Partitioned matrix (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300316302636
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:287-288:y:2016:i::p:50-59

DOI: 10.1016/j.amc.2016.04.013

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().