将状态表转换为彩色Petri网,用于互联网协议的自动验证

San Choosang, S. Gordon
{"title":"将状态表转换为彩色Petri网,用于互联网协议的自动验证","authors":"San Choosang, S. Gordon","doi":"10.1109/JCSSE.2011.5930096","DOIUrl":null,"url":null,"abstract":"Rapid developments in networking technologies is resulting in an increasing number of new communication protocols being created, but formal methods are seldom used to verify their design. This paper presents a set of rules for transforming state tables, a common format of protocol specifications in standards, into a formal model based on Coloured Petri nets. This reduces time for developing and debugging CPN models, which can then be used for protocol verification. Formal definitions of subsets of state tables and CPNs are presented, as well as the transformation algorithm. To demonstrate the transformation an example of Stop-and-Wait protocol is used as a case study.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Transforming state tables to Coloured Petri nets for automatic verification of internet protocols\",\"authors\":\"San Choosang, S. Gordon\",\"doi\":\"10.1109/JCSSE.2011.5930096\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Rapid developments in networking technologies is resulting in an increasing number of new communication protocols being created, but formal methods are seldom used to verify their design. This paper presents a set of rules for transforming state tables, a common format of protocol specifications in standards, into a formal model based on Coloured Petri nets. This reduces time for developing and debugging CPN models, which can then be used for protocol verification. Formal definitions of subsets of state tables and CPNs are presented, as well as the transformation algorithm. To demonstrate the transformation an example of Stop-and-Wait protocol is used as a case study.\",\"PeriodicalId\":287775,\"journal\":{\"name\":\"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-05-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/JCSSE.2011.5930096\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/JCSSE.2011.5930096","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

网络技术的快速发展导致越来越多的新通信协议被创建,但很少使用正式的方法来验证它们的设计。本文提出了一套将状态表(标准中常见的协议规范格式)转换为基于彩色Petri网的形式化模型的规则。这减少了开发和调试CPN模型的时间,然后可以使用CPN模型进行协议验证。给出了状态表和cpn子集的形式化定义,以及转换算法。为了演示这种转换,我们使用了一个“停止-等待”协议的示例作为案例研究。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Transforming state tables to Coloured Petri nets for automatic verification of internet protocols
Rapid developments in networking technologies is resulting in an increasing number of new communication protocols being created, but formal methods are seldom used to verify their design. This paper presents a set of rules for transforming state tables, a common format of protocol specifications in standards, into a formal model based on Coloured Petri nets. This reduces time for developing and debugging CPN models, which can then be used for protocol verification. Formal definitions of subsets of state tables and CPNs are presented, as well as the transformation algorithm. To demonstrate the transformation an example of Stop-and-Wait protocol is used as a case study.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Transforming state tables to Coloured Petri nets for automatic verification of internet protocols Clustering by attraction and distraction Event recognition from information-linkage based using phrase tree traversal Towards a complete project oriented risk management model: A refinement of PRORISK Solving software module clustering problem by evolutionary algorithms
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1