{"title":"自稳定程序的结构化设计","authors":"F. Stomp","doi":"10.1109/ISTCS.1993.253472","DOIUrl":null,"url":null,"abstract":"Much effort has been invested in recent years to propose self-stabilizing programs for various purposes. Only little attention has been paid to the structured, formal design and verification of such programs. The current paper presents a sound and formal principle for designing, hence verifying self-stabilizing programs. This principle, which combines programs into larger ones, is formulated in linear time temporal logic and captures the underlying intuition of many designers of self-stabilizing programs in a natural way. The proposed principle is applied to a program, due to Ghosh and Karaata (1991), for coloring a graph.<<ETX>>","PeriodicalId":281109,"journal":{"name":"[1993] The 2nd Israel Symposium on Theory and Computing Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":"{\"title\":\"Structured design of self-stabilizing programs\",\"authors\":\"F. Stomp\",\"doi\":\"10.1109/ISTCS.1993.253472\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Much effort has been invested in recent years to propose self-stabilizing programs for various purposes. Only little attention has been paid to the structured, formal design and verification of such programs. The current paper presents a sound and formal principle for designing, hence verifying self-stabilizing programs. This principle, which combines programs into larger ones, is formulated in linear time temporal logic and captures the underlying intuition of many designers of self-stabilizing programs in a natural way. The proposed principle is applied to a program, due to Ghosh and Karaata (1991), for coloring a graph.<<ETX>>\",\"PeriodicalId\":281109,\"journal\":{\"name\":\"[1993] The 2nd Israel Symposium on Theory and Computing Systems\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-06-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"22\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1993] The 2nd Israel Symposium on Theory and Computing Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISTCS.1993.253472\",\"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] The 2nd Israel Symposium on Theory and Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISTCS.1993.253472","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Much effort has been invested in recent years to propose self-stabilizing programs for various purposes. Only little attention has been paid to the structured, formal design and verification of such programs. The current paper presents a sound and formal principle for designing, hence verifying self-stabilizing programs. This principle, which combines programs into larger ones, is formulated in linear time temporal logic and captures the underlying intuition of many designers of self-stabilizing programs in a natural way. The proposed principle is applied to a program, due to Ghosh and Karaata (1991), for coloring a graph.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
![[1993] The 2nd Israel Symposium on Theory and Computing Systems](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
扫码关注我们
