基于单元独立性的快速定时验证方法

T. Yoneda, Kazutoshi Nakade, Y. Tohma
{"title":"基于单元独立性的快速定时验证方法","authors":"T. Yoneda, Kazutoshi Nakade, Y. Tohma","doi":"10.1109/FTCS.1989.105556","DOIUrl":null,"url":null,"abstract":"A novel timing verification method is presented. A system is divided into units, and the behavior of each unit is described by the internal state transitions and the occurrence of events. The analysis method reveals all possible system behavior, ignoring the timing relations between events that occur at different units. The results of an example (bus access protocol for the PROWAY system) for the timing verification of larger systems show that the method is much faster and needs much less memory region than the method based on timed Petri nets.<<ETX>>","PeriodicalId":230363,"journal":{"name":"[1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"A fast timing verification method based on the independence of units\",\"authors\":\"T. Yoneda, Kazutoshi Nakade, Y. Tohma\",\"doi\":\"10.1109/FTCS.1989.105556\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A novel timing verification method is presented. A system is divided into units, and the behavior of each unit is described by the internal state transitions and the occurrence of events. The analysis method reveals all possible system behavior, ignoring the timing relations between events that occur at different units. The results of an example (bus access protocol for the PROWAY system) for the timing verification of larger systems show that the method is much faster and needs much less memory region than the method based on timed Petri nets.<<ETX>>\",\"PeriodicalId\":230363,\"journal\":{\"name\":\"[1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-06-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FTCS.1989.105556\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FTCS.1989.105556","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19

摘要

提出了一种新的定时验证方法。一个系统被分成多个单元,每个单元的行为由内部状态转换和事件的发生来描述。分析方法揭示了所有可能的系统行为,忽略了在不同单元发生的事件之间的时间关系。一个大型系统的时序验证实例(PROWAY系统的总线访问协议)的结果表明,该方法比基于定时Petri网的方法要快得多,所需的内存面积也少得多。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A fast timing verification method based on the independence of units
A novel timing verification method is presented. A system is divided into units, and the behavior of each unit is described by the internal state transitions and the occurrence of events. The analysis method reveals all possible system behavior, ignoring the timing relations between events that occur at different units. The results of an example (bus access protocol for the PROWAY system) for the timing verification of larger systems show that the method is much faster and needs much less memory region than the method based on timed Petri nets.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信