使用进程代数的协议验证的模块化方法

Logic group preprint series Pub Date : 1986-04-01 DOI:10.1017/CBO9780511608841.012

C. Koymans, J. Mulder

{"title":"使用进程代数的协议验证的模块化方法","authors":"C. Koymans, J. Mulder","doi":"10.1017/CBO9780511608841.012","DOIUrl":null,"url":null,"abstract":"A version of the Alternating Bit Protocol is verified by means of \nProcess Algebra. To avoid a combinatorial explosion, a notion of \"modules\" \nis introduced and the protocol is divided in two such modules. A method \nis developed for verifying conglomerates of modules and applied to the \nmotivating example.","PeriodicalId":161799,"journal":{"name":"Logic group preprint series","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1986-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"66","resultStr":"{\"title\":\"A modular approach to protocol verification using process algebra\",\"authors\":\"C. Koymans, J. Mulder\",\"doi\":\"10.1017/CBO9780511608841.012\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A version of the Alternating Bit Protocol is verified by means of \\nProcess Algebra. To avoid a combinatorial explosion, a notion of \\\"modules\\\" \\nis introduced and the protocol is divided in two such modules. A method \\nis developed for verifying conglomerates of modules and applied to the \\nmotivating example.\",\"PeriodicalId\":161799,\"journal\":{\"name\":\"Logic group preprint series\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1986-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"66\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Logic group preprint series\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1017/CBO9780511608841.012\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Logic group preprint series","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1017/CBO9780511608841.012","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 66

摘要

用进程代数的方法验证了交替比特协议的一个版本。为了避免组合爆炸，引入了“模块”的概念，并将协议分为两个这样的模块。提出了一种验证模块集合的方法，并应用于激励实例。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A modular approach to protocol verification using process algebra

A version of the Alternating Bit Protocol is verified by means of Process Algebra. To avoid a combinatorial explosion, a notion of "modules" is introduced and the protocol is divided in two such modules. A method is developed for verifying conglomerates of modules and applied to the motivating example.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Logic group preprint series

自引率

0.00%

发文量