Scholarlink

<p>The modeling and control of networks over finite lattices are studied via the algebraic state space approach. Using the semi-tensor product of matrices, we obtain the algebraic state space representation (ASSR) of the dynamics of (control) networks over finite lattices. Basic properties concerning networks over sublattices and product lattices are investigated, which shows the application of the analysis of lattice structure in the model reduction and control design of networks. Then, algorithms are developed to recover the lattice structure from the structure matrix of a network over a lattice, and to construct comparability graphs over a finite set to verify whether a multiple-valued logical network is defined over a lattice. Finally, numerical examples are presented to illustrate the results.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

On control networks over finite lattices

  • 期刊论文

  • 发表日期：

    2025年3月25日

查看全文
  • Zhengping Ji,
  • Daizhan Cheng

摘要

The modeling and control of networks over finite lattices are studied via the algebraic state space approach. Using the semi-tensor product of matrices, we obtain the algebraic state space representation (ASSR) of the dynamics of (control) networks over finite lattices. Basic properties concerning networks over sublattices and product lattices are investigated, which shows the application of the analysis of lattice structure in the model reduction and control design of networks. Then, algorithms are developed to recover the lattice structure from the structure matrix of a network over a lattice, and to construct comparability graphs over a finite set to verify whether a multiple-valued logical network is defined over a lattice. Finally, numerical examples are presented to illustrate the results.