Pierre-Alain Bourdil, B. Berthomieu, Silvano Dal-Zilio, F. Vernadat
{"title":"时间petri网的对称简化状态类","authors":"Pierre-Alain Bourdil, B. Berthomieu, Silvano Dal-Zilio, F. Vernadat","doi":"10.1145/2695664.2695803","DOIUrl":null,"url":null,"abstract":"We propose a method to exploit the symmetries of a realtime system represented by a Time Petri net for its verification by model-checking. The method handles both markings and timing constraints; it can be used in conjunction with the widely used state classes abstraction. The approach has been implemented and experiments are reported.","PeriodicalId":206481,"journal":{"name":"Proceedings of the 30th Annual ACM Symposium on Applied Computing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Symmetry reduced state classes for time petri nets\",\"authors\":\"Pierre-Alain Bourdil, B. Berthomieu, Silvano Dal-Zilio, F. Vernadat\",\"doi\":\"10.1145/2695664.2695803\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a method to exploit the symmetries of a realtime system represented by a Time Petri net for its verification by model-checking. The method handles both markings and timing constraints; it can be used in conjunction with the widely used state classes abstraction. The approach has been implemented and experiments are reported.\",\"PeriodicalId\":206481,\"journal\":{\"name\":\"Proceedings of the 30th Annual ACM Symposium on Applied Computing\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-04-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 30th Annual ACM Symposium on Applied Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2695664.2695803\",\"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 of the 30th Annual ACM Symposium on Applied Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2695664.2695803","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Symmetry reduced state classes for time petri nets
We propose a method to exploit the symmetries of a realtime system represented by a Time Petri net for its verification by model-checking. The method handles both markings and timing constraints; it can be used in conjunction with the widely used state classes abstraction. The approach has been implemented and experiments are reported.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
