分布式程序可达性分析的增量方法

Proceedings of 1993 IEEE 7th International Workshop on Software Specification and Design Pub Date : 1993-12-06 DOI:10.1109/IWSSD.1993.315504

K. Tai, P. Koppol

{"title":"分布式程序可达性分析的增量方法","authors":"K. Tai, P. Koppol","doi":"10.1109/IWSSD.1993.315504","DOIUrl":null,"url":null,"abstract":"We present an incremental approach to reachability analysis of distributed programs with synchronous communication and mailbox naming. Each process in a distributed program can be modeled as a communicating finite state machine (CFSM). A set of CFSMs is organized into a hierarchy. We present an algorithm that, for a given hierarchy of a set M of CFSMs, incrementally composes and reduces subsets of CFSMs in M. This incremental reachability analysis guarantees the detection of global deadlocks. We provide an algorithm for selecting a hierarchy for a set of CFSMs and show an incremental analysis of the gas station problem.<<ETX>>","PeriodicalId":259574,"journal":{"name":"Proceedings of 1993 IEEE 7th International Workshop on Software Specification and Design","volume":"74 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"34","resultStr":"{\"title\":\"An incremental approach to reachability analysis of distributed programs\",\"authors\":\"K. Tai, P. Koppol\",\"doi\":\"10.1109/IWSSD.1993.315504\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present an incremental approach to reachability analysis of distributed programs with synchronous communication and mailbox naming. Each process in a distributed program can be modeled as a communicating finite state machine (CFSM). A set of CFSMs is organized into a hierarchy. We present an algorithm that, for a given hierarchy of a set M of CFSMs, incrementally composes and reduces subsets of CFSMs in M. This incremental reachability analysis guarantees the detection of global deadlocks. We provide an algorithm for selecting a hierarchy for a set of CFSMs and show an incremental analysis of the gas station problem.<<ETX>>\",\"PeriodicalId\":259574,\"journal\":{\"name\":\"Proceedings of 1993 IEEE 7th International Workshop on Software Specification and Design\",\"volume\":\"74 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-12-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"34\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1993 IEEE 7th International Workshop on Software Specification and Design\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWSSD.1993.315504\",\"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 1993 IEEE 7th International Workshop on Software Specification and Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWSSD.1993.315504","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 34

摘要

提出了一种基于同步通信和邮箱命名的增量式分布式程序可达性分析方法。分布式程序中的每个进程都可以建模为一个通信有限状态机(CFSM)。一组cfsm被组织成一个层次结构。我们提出了一种算法，对于给定层次结构的cfsm集合M，增量地组合和减少M中的cfsm子集，这种增量可达性分析保证了全局死锁的检测。我们提供了一种为一组cfsm选择层次结构的算法，并展示了加油站问题的增量分析。

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

查看原文本刊更多论文

An incremental approach to reachability analysis of distributed programs

We present an incremental approach to reachability analysis of distributed programs with synchronous communication and mailbox naming. Each process in a distributed program can be modeled as a communicating finite state machine (CFSM). A set of CFSMs is organized into a hierarchy. We present an algorithm that, for a given hierarchy of a set M of CFSMs, incrementally composes and reduces subsets of CFSMs in M. This incremental reachability analysis guarantees the detection of global deadlocks. We provide an algorithm for selecting a hierarchy for a set of CFSMs and show an incremental analysis of the gas station problem.<>

求助全文

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

来源期刊

Proceedings of 1993 IEEE 7th International Workshop on Software Specification and Design

自引率

0.00%

发文量