{"title":"实时并发系统的可扩展组合可达性分析","authors":"Farn Wang","doi":"10.1109/RTTAS.1996.509535","DOIUrl":null,"url":null,"abstract":"A description model for high level behavior of a real time concurrent system is presented. A verification algorithm is then devised to take advantage of interaction locality and symmetry and internal operation concealment in the model. A system called VERIFAST implements the algorithm. Experiments show that VERIFAST runs fast and exhibits time complexity linear to the size of concurrency in a benchmark.","PeriodicalId":324830,"journal":{"name":"Proceedings Real-Time Technology and Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Scalable compositional reachability analysis of real-time concurrent systems\",\"authors\":\"Farn Wang\",\"doi\":\"10.1109/RTTAS.1996.509535\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A description model for high level behavior of a real time concurrent system is presented. A verification algorithm is then devised to take advantage of interaction locality and symmetry and internal operation concealment in the model. A system called VERIFAST implements the algorithm. Experiments show that VERIFAST runs fast and exhibits time complexity linear to the size of concurrency in a benchmark.\",\"PeriodicalId\":324830,\"journal\":{\"name\":\"Proceedings Real-Time Technology and Applications\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-06-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Real-Time Technology and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RTTAS.1996.509535\",\"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 Real-Time Technology and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RTTAS.1996.509535","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Scalable compositional reachability analysis of real-time concurrent systems
A description model for high level behavior of a real time concurrent system is presented. A verification algorithm is then devised to take advantage of interaction locality and symmetry and internal operation concealment in the model. A system called VERIFAST implements the algorithm. Experiments show that VERIFAST runs fast and exhibits time complexity linear to the size of concurrency in a benchmark.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
