{"title":"开放环境下基于分层时间自动机的动态演化过程验证","authors":"Yu Zhou, Jidong Ge, Pengcheng Zhang","doi":"10.1145/2600821.2600838","DOIUrl":null,"url":null,"abstract":"The paper proposes a novel approach based on the hierarchical timed automata to verify the consistency of dynamic evolution process. Different from traditional approaches, it investigates the problem from the behavioral perspective and examines the procedures before, during and after the evolution process. Furthermore, our approach can support the direct modeling of temporal aspects, as well as the hierarchical structures. A flattening algorithm is presented to facilitate the automated verification using the mainstream timed automata based model checker --UPPAAL. A motivating example is discussed and demonstrates the feasibility of our approach.","PeriodicalId":296714,"journal":{"name":"International Conference on Software and Systems Process","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Hierarchical timed automata based verification of dynamic evolution process in open environments\",\"authors\":\"Yu Zhou, Jidong Ge, Pengcheng Zhang\",\"doi\":\"10.1145/2600821.2600838\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper proposes a novel approach based on the hierarchical timed automata to verify the consistency of dynamic evolution process. Different from traditional approaches, it investigates the problem from the behavioral perspective and examines the procedures before, during and after the evolution process. Furthermore, our approach can support the direct modeling of temporal aspects, as well as the hierarchical structures. A flattening algorithm is presented to facilitate the automated verification using the mainstream timed automata based model checker --UPPAAL. A motivating example is discussed and demonstrates the feasibility of our approach.\",\"PeriodicalId\":296714,\"journal\":{\"name\":\"International Conference on Software and Systems Process\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-05-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Software and Systems Process\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2600821.2600838\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Software and Systems Process","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2600821.2600838","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Hierarchical timed automata based verification of dynamic evolution process in open environments
The paper proposes a novel approach based on the hierarchical timed automata to verify the consistency of dynamic evolution process. Different from traditional approaches, it investigates the problem from the behavioral perspective and examines the procedures before, during and after the evolution process. Furthermore, our approach can support the direct modeling of temporal aspects, as well as the hierarchical structures. A flattening algorithm is presented to facilitate the automated verification using the mainstream timed automata based model checker --UPPAAL. A motivating example is discussed and demonstrates the feasibility of our approach.