{"title":"一个简化时间自动机的简单方法","authors":"I. Kitouni, H. Hachichi, S. D. Eddine","doi":"10.1109/ICITES.2012.6216600","DOIUrl":null,"url":null,"abstract":"Today model checking is the most useful verification method of real time systems, so there is a serious need for improving its efficiency with respect to both time and resources. In this paper we present a new approach for reducing timed automata. In fact regions of a region automaton are aggregated according to a coarse equivalence class partitioning based on traces. We will show that the proposed algorithm terminates and preserves original timed automaton behavior.","PeriodicalId":137864,"journal":{"name":"2012 International Conference on Information Technology and e-Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A simple approach for reducing timed automata\",\"authors\":\"I. Kitouni, H. Hachichi, S. D. Eddine\",\"doi\":\"10.1109/ICITES.2012.6216600\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Today model checking is the most useful verification method of real time systems, so there is a serious need for improving its efficiency with respect to both time and resources. In this paper we present a new approach for reducing timed automata. In fact regions of a region automaton are aggregated according to a coarse equivalence class partitioning based on traces. We will show that the proposed algorithm terminates and preserves original timed automaton behavior.\",\"PeriodicalId\":137864,\"journal\":{\"name\":\"2012 International Conference on Information Technology and e-Services\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-03-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 International Conference on Information Technology and e-Services\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICITES.2012.6216600\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Information Technology and e-Services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICITES.2012.6216600","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Today model checking is the most useful verification method of real time systems, so there is a serious need for improving its efficiency with respect to both time and resources. In this paper we present a new approach for reducing timed automata. In fact regions of a region automaton are aggregated according to a coarse equivalence class partitioning based on traces. We will show that the proposed algorithm terminates and preserves original timed automaton behavior.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
