验证通信协议的代数方法

Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems Pub Date : 1992-04-14 DOI:10.1109/FTDCS.1992.217517

A. Benslimane

{"title":"验证通信协议的代数方法","authors":"A. Benslimane","doi":"10.1109/FTDCS.1992.217517","DOIUrl":null,"url":null,"abstract":"Realizing the need for a precise model of computer communications protocols, many different approaches are being investigated. The author presents an algebraic approach to formally specify protocols composed of many modules. The protocols studied are described in the model of finite state machine and then transformed into a set of process equations. The main concept consists in carrying out transformations on these equations in order to prove some properties. The reachability analysis can then be defined in the form of algebraic transformation rules applied to the global system states. The properties to verify during the communication between processes are the detection of some logical errors such as deadlocks, blocking or unspecified receptions.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An algebraic approach to validate communication protocols\",\"authors\":\"A. Benslimane\",\"doi\":\"10.1109/FTDCS.1992.217517\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Realizing the need for a precise model of computer communications protocols, many different approaches are being investigated. The author presents an algebraic approach to formally specify protocols composed of many modules. The protocols studied are described in the model of finite state machine and then transformed into a set of process equations. The main concept consists in carrying out transformations on these equations in order to prove some properties. The reachability analysis can then be defined in the form of algebraic transformation rules applied to the global system states. The properties to verify during the communication between processes are the detection of some logical errors such as deadlocks, blocking or unspecified receptions.<<ETX>>\",\"PeriodicalId\":186762,\"journal\":{\"name\":\"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-04-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FTDCS.1992.217517\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FTDCS.1992.217517","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

意识到需要一个精确的计算机通信协议模型，许多不同的方法正在被研究。作者提出了一种代数方法来形式化地指定由多个模块组成的协议。在有限状态机模型中描述所研究的协议，然后将其转化为一组过程方程。主要概念在于对这些方程进行变换，以证明某些性质。然后可以将可达性分析定义为应用于全局系统状态的代数转换规则的形式。在进程间通信期间要验证的属性是检测一些逻辑错误，如死锁、阻塞或未指定的接收。

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

查看原文本刊更多论文

An algebraic approach to validate communication protocols

Realizing the need for a precise model of computer communications protocols, many different approaches are being investigated. The author presents an algebraic approach to formally specify protocols composed of many modules. The protocols studied are described in the model of finite state machine and then transformed into a set of process equations. The main concept consists in carrying out transformations on these equations in order to prove some properties. The reachability analysis can then be defined in the form of algebraic transformation rules applied to the global system states. The properties to verify during the communication between processes are the detection of some logical errors such as deadlocks, blocking or unspecified receptions.<>

求助全文

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

来源期刊

Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems

自引率

0.00%

发文量