{"title":"使用形状分析来验证模型驱动设计中的图形转换","authors":"Dominik Steenken, Daniel Wonisch","doi":"10.1109/INDIN.2011.6034922","DOIUrl":null,"url":null,"abstract":"In model driven design processes, graph transformation systems are frequently used to model dynamic behaviour. Many complex models induce arbitratily large state spaces. Since the systems they model are often safety-critical, they need to be verified. Explicit modelchecking fails here, since it requires the construction of the entire state space. In this paper, we present a verification technique that can handle arbitrarily large state spaces. Furthermore we show that it can easily be integrated in existing model driven design processes.","PeriodicalId":378407,"journal":{"name":"2011 9th IEEE International Conference on Industrial Informatics","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Using shape analysis to verify graph transformations in model driven design\",\"authors\":\"Dominik Steenken, Daniel Wonisch\",\"doi\":\"10.1109/INDIN.2011.6034922\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In model driven design processes, graph transformation systems are frequently used to model dynamic behaviour. Many complex models induce arbitratily large state spaces. Since the systems they model are often safety-critical, they need to be verified. Explicit modelchecking fails here, since it requires the construction of the entire state space. In this paper, we present a verification technique that can handle arbitrarily large state spaces. Furthermore we show that it can easily be integrated in existing model driven design processes.\",\"PeriodicalId\":378407,\"journal\":{\"name\":\"2011 9th IEEE International Conference on Industrial Informatics\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-07-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 9th IEEE International Conference on Industrial Informatics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INDIN.2011.6034922\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 9th IEEE International Conference on Industrial Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INDIN.2011.6034922","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Using shape analysis to verify graph transformations in model driven design
In model driven design processes, graph transformation systems are frequently used to model dynamic behaviour. Many complex models induce arbitratily large state spaces. Since the systems they model are often safety-critical, they need to be verified. Explicit modelchecking fails here, since it requires the construction of the entire state space. In this paper, we present a verification technique that can handle arbitrarily large state spaces. Furthermore we show that it can easily be integrated in existing model driven design processes.