{"title":"概率定时CEGAR的发展","authors":"S. Yamane, T. Shimizu","doi":"10.1109/ICSAI.2014.7009336","DOIUrl":null,"url":null,"abstract":"In this paper, we present an efficient verification method for probabilistic timed automaton. This method based on predicate abstractions and refinements realizes effective automated verifications for real-time and probabilistic embedded systems.","PeriodicalId":143221,"journal":{"name":"The 2014 2nd International Conference on Systems and Informatics (ICSAI 2014)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Development of probabilistic timed CEGAR\",\"authors\":\"S. Yamane, T. Shimizu\",\"doi\":\"10.1109/ICSAI.2014.7009336\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present an efficient verification method for probabilistic timed automaton. This method based on predicate abstractions and refinements realizes effective automated verifications for real-time and probabilistic embedded systems.\",\"PeriodicalId\":143221,\"journal\":{\"name\":\"The 2014 2nd International Conference on Systems and Informatics (ICSAI 2014)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 2014 2nd International Conference on Systems and Informatics (ICSAI 2014)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSAI.2014.7009336\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2014 2nd International Conference on Systems and Informatics (ICSAI 2014)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSAI.2014.7009336","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper, we present an efficient verification method for probabilistic timed automaton. This method based on predicate abstractions and refinements realizes effective automated verifications for real-time and probabilistic embedded systems.