CORC  > 清华大学
Min-max inequalities and the timing verification problem with max and linear constraints
Cheng, YP ; Zheng, DZ
2010-05-06 ; 2010-05-06
关键词discrete event systems min-max inequalities min-max functions timing analysis and verification ALGORITHM SYSTEMS Automation & Control Systems Operations Research & Management Science Mathematics, Applied
中文摘要In this paper the timing verification problem with max and linear constraints is formulated in min-max inequalities. An algorithm MMI solve, based on the UBC solve algorithm of Walkup, is proposed for solving min-max inequalities and for efficiently finding the maximum time separations between events. A concept of structural finite separation is introduced, and it is found that structural finite separation is a sufficient, but not necessary condition for Finite separation. The two conditions are equivalent when the parameters are only allowed to take nonnegative values.
语种英语 ; 英语
出版者SPRINGER ; DORDRECHT ; VAN GODEWIJCKSTRAAT 30, 3311 GZ DORDRECHT, NETHERLANDS
内容类型期刊论文
源URL[http://hdl.handle.net/123456789/9472]  
专题清华大学
推荐引用方式
GB/T 7714
Cheng, YP,Zheng, DZ. Min-max inequalities and the timing verification problem with max and linear constraints[J],2010, 2010.
APA Cheng, YP,&Zheng, DZ.(2010).Min-max inequalities and the timing verification problem with max and linear constraints..
MLA Cheng, YP,et al."Min-max inequalities and the timing verification problem with max and linear constraints".(2010).
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace