首页> 外文会议>Chinese Control Conference >Logic-based Solvability of Max-plus Linear Equations
【24h】

Logic-based Solvability of Max-plus Linear Equations

机译:最大加线性方程组的基于逻辑的可解性

获取原文
获取外文期刊封面目录资料

摘要

Max-plus algebra is an important tool for studying various types of discrete event systems. In this paper, a logic-based solvability method is proposed to study several kinds of max-plus linear equations. Firstly, an equivalent logical equation is constructed for the max-plus linear equation A ⊗ x = b, based on which, some new necessary and sufficient conditions are presented for the existence and uniqueness of solutions. Secondly, the solvability of max-plus linear equation A ⊗ x = b is given by applying semi-tensor product of matrices to solve the equivalent logical equation. Thirdly, using the column stacking approach, A ⊗ X ⊕ X ⊗ B = C is converted into the form of A ⊗ x = b. Several examples are given to illustrate the obtained results.
机译:最大加数代数是研究各种类型的离散事件系统的重要工具。本文提出了一种基于逻辑的可解性方法来研究几种最大加线性方程组。首先,为最大加线性方程A⊗x = b构造一个等价逻辑方程,在此基础上,提出了一些新的充要条件,以求解的存在性和唯一性。其次,通过应用矩阵的半张量积来求解等价逻辑方程,从而给出最大加线性方程A⊗x = b的可解性。第三,使用列堆叠方法,将A⊗X⊕X⊗B = C转换为A⊗x = b的形式。给出了几个例子来说明所获得的结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号