{"title":"验证系统受密集时间约束和概率约束","authors":"S. Yamane","doi":"10.1109/SEEP.1996.533998","DOIUrl":null,"url":null,"abstract":"Formal verification and specification are important for real-time software. In this paper, in order to maintain the reliability of the software, we consider that the notion of dense timing and probabilities are necessary. In this paper, we propose the following methods in order to specify and verify performance properties in the dense time model. We propose a probabilistic dense-time statechart by extending the concept of the statechart with dense time and probabilities. We also propose a probabilistic dense-time temporal logic by extending TCTL (timed computation tree logic) with probabilities. Finally, we propose an automatic verification method. We have developed a verification system based on the proposed method and shown it to be effective.","PeriodicalId":416862,"journal":{"name":"Proceedings 1996 International Conference Software Engineering: Education and Practice","volume":"119 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The verification system by dense timing constraints and probabilities\",\"authors\":\"S. Yamane\",\"doi\":\"10.1109/SEEP.1996.533998\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Formal verification and specification are important for real-time software. In this paper, in order to maintain the reliability of the software, we consider that the notion of dense timing and probabilities are necessary. In this paper, we propose the following methods in order to specify and verify performance properties in the dense time model. We propose a probabilistic dense-time statechart by extending the concept of the statechart with dense time and probabilities. We also propose a probabilistic dense-time temporal logic by extending TCTL (timed computation tree logic) with probabilities. Finally, we propose an automatic verification method. We have developed a verification system based on the proposed method and shown it to be effective.\",\"PeriodicalId\":416862,\"journal\":{\"name\":\"Proceedings 1996 International Conference Software Engineering: Education and Practice\",\"volume\":\"119 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-01-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1996 International Conference Software Engineering: Education and Practice\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SEEP.1996.533998\",\"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 1996 International Conference Software Engineering: Education and Practice","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SEEP.1996.533998","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The verification system by dense timing constraints and probabilities
Formal verification and specification are important for real-time software. In this paper, in order to maintain the reliability of the software, we consider that the notion of dense timing and probabilities are necessary. In this paper, we propose the following methods in order to specify and verify performance properties in the dense time model. We propose a probabilistic dense-time statechart by extending the concept of the statechart with dense time and probabilities. We also propose a probabilistic dense-time temporal logic by extending TCTL (timed computation tree logic) with probabilities. Finally, we propose an automatic verification method. We have developed a verification system based on the proposed method and shown it to be effective.