{"title":"计算图中所有循环的一种方法","authors":"C. Popescu, A. Lobov, J. Lastra","doi":"10.1109/INDIN.2006.275842","DOIUrl":null,"url":null,"abstract":"Analysis of the set of all cycles in a reachability graph of a system could bring new and useful insight into the system's behavior. This paper presents a method for computation of all cycles in a reachability graph. The method is based on structural reduction of the state space, followed by an encoding - decoding procedure applied to the reduced set of states. The proposed approach is believed to be beneficial with respect to memory constraints.","PeriodicalId":120426,"journal":{"name":"2006 4th IEEE International Conference on Industrial Informatics","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An Approach To Computing All Cycles in a Graph\",\"authors\":\"C. Popescu, A. Lobov, J. Lastra\",\"doi\":\"10.1109/INDIN.2006.275842\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Analysis of the set of all cycles in a reachability graph of a system could bring new and useful insight into the system's behavior. This paper presents a method for computation of all cycles in a reachability graph. The method is based on structural reduction of the state space, followed by an encoding - decoding procedure applied to the reduced set of states. The proposed approach is believed to be beneficial with respect to memory constraints.\",\"PeriodicalId\":120426,\"journal\":{\"name\":\"2006 4th IEEE International Conference on Industrial Informatics\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 4th IEEE International Conference on Industrial Informatics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INDIN.2006.275842\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 4th IEEE International Conference on Industrial Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INDIN.2006.275842","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Analysis of the set of all cycles in a reachability graph of a system could bring new and useful insight into the system's behavior. This paper presents a method for computation of all cycles in a reachability graph. The method is based on structural reduction of the state space, followed by an encoding - decoding procedure applied to the reduced set of states. The proposed approach is believed to be beneficial with respect to memory constraints.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
