动态上升路由的一种表征

[1988] Proceedings. Workshop on the Future Trends of Distributed Computing Systems in the 1990s Pub Date : 1988-09-14 DOI:10.1109/FTDCS.1988.26703

A. Bouabdallah, M. Tréhel

{"title":"动态上升路由的一种表征","authors":"A. Bouabdallah, M. Tréhel","doi":"10.1109/FTDCS.1988.26703","DOIUrl":null,"url":null,"abstract":"A characterization of a routing defined on a dynamical logical structure is presented. By uniting the structure with the messages destabilizing it, an invariant is obtained, that allows a simple proof of the properties of the routing. The results are exploited by designing and structuring the proof of the mutual exclusion algorithm, which uses this routing. The specifications are done in an axiomatic manner, and the proof is given in a temporal framework.<<ETX>>","PeriodicalId":384536,"journal":{"name":"[1988] Proceedings. Workshop on the Future Trends of Distributed Computing Systems in the 1990s","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A characterization of the dynamical ascending routing\",\"authors\":\"A. Bouabdallah, M. Tréhel\",\"doi\":\"10.1109/FTDCS.1988.26703\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A characterization of a routing defined on a dynamical logical structure is presented. By uniting the structure with the messages destabilizing it, an invariant is obtained, that allows a simple proof of the properties of the routing. The results are exploited by designing and structuring the proof of the mutual exclusion algorithm, which uses this routing. The specifications are done in an axiomatic manner, and the proof is given in a temporal framework.<<ETX>>\",\"PeriodicalId\":384536,\"journal\":{\"name\":\"[1988] Proceedings. Workshop on the Future Trends of Distributed Computing Systems in the 1990s\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-09-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1988] Proceedings. Workshop on the Future Trends of Distributed Computing Systems in the 1990s\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FTDCS.1988.26703\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1988] Proceedings. Workshop on the Future Trends of Distributed Computing Systems in the 1990s","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FTDCS.1988.26703","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

给出了在动态逻辑结构上定义路由的一种表征。通过将结构与破坏它的消息结合起来，可以获得一个不变量，它允许简单地证明路由的属性。通过设计和构造使用该路由的互斥算法的证明，利用了这些结果。这些说明是以一种公理的方式完成的，而证明是在一个时间框架中给出的。

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

查看原文本刊更多论文

A characterization of the dynamical ascending routing

A characterization of a routing defined on a dynamical logical structure is presented. By uniting the structure with the messages destabilizing it, an invariant is obtained, that allows a simple proof of the properties of the routing. The results are exploited by designing and structuring the proof of the mutual exclusion algorithm, which uses this routing. The specifications are done in an axiomatic manner, and the proof is given in a temporal framework.<>

求助全文

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

来源期刊

[1988] Proceedings. Workshop on the Future Trends of Distributed Computing Systems in the 1990s

自引率

0.00%

发文量