/spl alpha/SPIN中时间逻辑的抽象模型检验与改进

Third International Conference on Application of Concurrency to System Design, 2003. Proceedings. Pub Date : 2003-06-18 DOI:10.1109/CSD.2003.1207725

M. Gallardo, Jesús Martínez, P. Merino, E. Pimentel

{"title":"/spl alpha/SPIN中时间逻辑的抽象模型检验与改进","authors":"M. Gallardo, Jesús Martínez, P. Merino, E. Pimentel","doi":"10.1109/CSD.2003.1207725","DOIUrl":null,"url":null,"abstract":"We give an overview of the features offered by the tool /spl alpha/SPIN in order to perform abstract model checking of LTL formulas. Shortly, these features are: construction of over-approximated PROMELA models, checking satisfaction of universal formulas, checking refutation of existential formulas, and on-the-fly refinement of the model by means of a refinement of the temporal formula to be verified.","PeriodicalId":228530,"journal":{"name":"Third International Conference on Application of Concurrency to System Design, 2003. Proceedings.","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Abstract model checking and refinement of temporal logic in /spl alpha/SPIN\",\"authors\":\"M. Gallardo, Jesús Martínez, P. Merino, E. Pimentel\",\"doi\":\"10.1109/CSD.2003.1207725\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We give an overview of the features offered by the tool /spl alpha/SPIN in order to perform abstract model checking of LTL formulas. Shortly, these features are: construction of over-approximated PROMELA models, checking satisfaction of universal formulas, checking refutation of existential formulas, and on-the-fly refinement of the model by means of a refinement of the temporal formula to be verified.\",\"PeriodicalId\":228530,\"journal\":{\"name\":\"Third International Conference on Application of Concurrency to System Design, 2003. Proceedings.\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-06-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Third International Conference on Application of Concurrency to System Design, 2003. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSD.2003.1207725\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Third International Conference on Application of Concurrency to System Design, 2003. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSD.2003.1207725","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

我们概述了工具/spl alpha/SPIN提供的功能，以便对LTL公式进行抽象模型检查。简而言之，这些特征是:构建过逼近PROMELA模型，检查全称公式的满足性，检查存在公式的反驳性，以及通过对待验证的时间公式的改进对模型进行实时改进。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Abstract model checking and refinement of temporal logic in /spl alpha/SPIN

We give an overview of the features offered by the tool /spl alpha/SPIN in order to perform abstract model checking of LTL formulas. Shortly, these features are: construction of over-approximated PROMELA models, checking satisfaction of universal formulas, checking refutation of existential formulas, and on-the-fly refinement of the model by means of a refinement of the temporal formula to be verified.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Third International Conference on Application of Concurrency to System Design, 2003. Proceedings.

自引率

0.00%

发文量