{"title":"自稳定协议的类别","authors":"J. Beauquier, S. Delaet","doi":"10.1109/FTDCS.1993.344201","DOIUrl":null,"url":null,"abstract":"Self-stabilization is an abstraction of fault tolerance for transient malfunctions. Intuitively, a self-stabilizing system is a system which can be started from any possible state. The authors here explore the possibility of transforming an arbitrary distributed protocol into a self-stabilizing one. It is proved that some conditions are sufficient for this transformation to be feasible. These conditions lead to a classification of distributed protocols according to the complexity for performing their transformation.<<ETX>>","PeriodicalId":251095,"journal":{"name":"1993 4th Workshop on Future Trends of Distributed Computing Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Classes of self-stabilizing protocols\",\"authors\":\"J. Beauquier, S. Delaet\",\"doi\":\"10.1109/FTDCS.1993.344201\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Self-stabilization is an abstraction of fault tolerance for transient malfunctions. Intuitively, a self-stabilizing system is a system which can be started from any possible state. The authors here explore the possibility of transforming an arbitrary distributed protocol into a self-stabilizing one. It is proved that some conditions are sufficient for this transformation to be feasible. These conditions lead to a classification of distributed protocols according to the complexity for performing their transformation.<<ETX>>\",\"PeriodicalId\":251095,\"journal\":{\"name\":\"1993 4th Workshop on Future Trends of Distributed Computing Systems\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-09-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1993 4th Workshop on Future Trends of Distributed Computing Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FTDCS.1993.344201\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1993 4th Workshop on Future Trends of Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FTDCS.1993.344201","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Self-stabilization is an abstraction of fault tolerance for transient malfunctions. Intuitively, a self-stabilizing system is a system which can be started from any possible state. The authors here explore the possibility of transforming an arbitrary distributed protocol into a self-stabilizing one. It is proved that some conditions are sufficient for this transformation to be feasible. These conditions lead to a classification of distributed protocols according to the complexity for performing their transformation.<>