{"title":"分层组织Petri网状态空间，用于可达性和死锁分析","authors":"Masato Notomi, T. Murata","doi":"10.1109/IPPS.1992.222996","DOIUrl":null,"url":null,"abstract":"Petri nets are a versatile tool for modeling and analyzing parallel and distributed computing systems. However state explosion is a major impediment to their analysis and practical applications. To cope with this problem, this paper proposes a method for constructing hierarchically organized state space (HOSS) of a bounded Petri net. Using the HOSS, the authors obtain necessary and sufficient conditions for reachability and deadlock, and algorithms to test if a given state (marking) is reachable from the initial state and if there is a deadlock state (a state with no successor states).<<ETX>>","PeriodicalId":340070,"journal":{"name":"Proceedings Sixth International Parallel Processing Symposium","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Hierarchically organized Petri net state space for reachability and deadlock analysis\",\"authors\":\"Masato Notomi, T. Murata\",\"doi\":\"10.1109/IPPS.1992.222996\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Petri nets are a versatile tool for modeling and analyzing parallel and distributed computing systems. However state explosion is a major impediment to their analysis and practical applications. To cope with this problem, this paper proposes a method for constructing hierarchically organized state space (HOSS) of a bounded Petri net. Using the HOSS, the authors obtain necessary and sufficient conditions for reachability and deadlock, and algorithms to test if a given state (marking) is reachable from the initial state and if there is a deadlock state (a state with no successor states).<<ETX>>\",\"PeriodicalId\":340070,\"journal\":{\"name\":\"Proceedings Sixth International Parallel Processing Symposium\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Sixth International Parallel Processing Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IPPS.1992.222996\",\"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 Sixth International Parallel Processing Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPPS.1992.222996","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Hierarchically organized Petri net state space for reachability and deadlock analysis
Petri nets are a versatile tool for modeling and analyzing parallel and distributed computing systems. However state explosion is a major impediment to their analysis and practical applications. To cope with this problem, this paper proposes a method for constructing hierarchically organized state space (HOSS) of a bounded Petri net. Using the HOSS, the authors obtain necessary and sufficient conditions for reachability and deadlock, and algorithms to test if a given state (marking) is reachable from the initial state and if there is a deadlock state (a state with no successor states).<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
