摘要
应用计时事件图中回路的线性代数特征 ,将线性离散事件动态系统的周期计算转化为线性规划 (LP)问题 ,并且得到的LP问题具有较少的变量和线性约束 ,避免了传统方法中对回路的穷举搜索 ,降低了计算的复杂性·
Based on the linear algebraic characteristic of cycles in timed event graphs, the paper transfers the periodicity computation of discrete event dynamic system (DEDS) to a linear programming(LP) problem with less variables and less constraints. The new formulation avoids searching all cycles in the system enumeratively, it improves the computation efficiency and overcomes the computational complexity of the previous approaches.
出处
《东北大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2001年第6期623-626,共4页
Journal of Northeastern University(Natural Science)
基金
教育部留学回国人员基金资助项目 ( 5 35 0 12 )
