{"title":"网络不变量的截止","authors":"Antti Siirtola","doi":"10.1109/ACSD.2010.16","DOIUrl":null,"url":null,"abstract":"We consider the multi-parameterised process algebraic verification of safety properties. There is a cut-off result for such verification tasks, but it cannot be naturally applied to systems involving linear parts. We show how the limitation can be overcome by computing a network invariant for each linear part and including all the processes obtained during the computation in the system model.","PeriodicalId":169191,"journal":{"name":"2010 10th International Conference on Application of Concurrency to System Design","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Cut-Offs with Network Invariants\",\"authors\":\"Antti Siirtola\",\"doi\":\"10.1109/ACSD.2010.16\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the multi-parameterised process algebraic verification of safety properties. There is a cut-off result for such verification tasks, but it cannot be naturally applied to systems involving linear parts. We show how the limitation can be overcome by computing a network invariant for each linear part and including all the processes obtained during the computation in the system model.\",\"PeriodicalId\":169191,\"journal\":{\"name\":\"2010 10th International Conference on Application of Concurrency to System Design\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-06-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 10th International Conference on Application of Concurrency to System Design\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACSD.2010.16\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 10th International Conference on Application of Concurrency to System Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSD.2010.16","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We consider the multi-parameterised process algebraic verification of safety properties. There is a cut-off result for such verification tasks, but it cannot be naturally applied to systems involving linear parts. We show how the limitation can be overcome by computing a network invariant for each linear part and including all the processes obtained during the computation in the system model.