满足CTL公式的模型的最小化

Time Pub Date : 2019-10-16 DOI:10.4230/LIPIcs.TIME.2019.13

S. Cerrito, Amélie David, V. Goranko

{"title":"满足CTL公式的模型的最小化","authors":"S. Cerrito, Amélie David, V. Goranko","doi":"10.4230/LIPIcs.TIME.2019.13","DOIUrl":null,"url":null,"abstract":"We study the problem of minimisation of a given finite pointed Kripke model satisfying a given CTL formula, with the only objective to preserve the satisfaction of that formula in the resulting reduced model. We consider minimisations of the model with respect both to state-based redundancies and formula-based redundancies in that model. We develop a procedure computing all such minimisations, illustrate it with some examples, and provide some complexity analysis for it.","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":"13:1-13:15"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Minimisation of Models Satisfying CTL Formulas\",\"authors\":\"S. Cerrito, Amélie David, V. Goranko\",\"doi\":\"10.4230/LIPIcs.TIME.2019.13\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the problem of minimisation of a given finite pointed Kripke model satisfying a given CTL formula, with the only objective to preserve the satisfaction of that formula in the resulting reduced model. We consider minimisations of the model with respect both to state-based redundancies and formula-based redundancies in that model. We develop a procedure computing all such minimisations, illustrate it with some examples, and provide some complexity analysis for it.\",\"PeriodicalId\":75226,\"journal\":{\"name\":\"Time\",\"volume\":\"1 1\",\"pages\":\"13:1-13:15\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Time\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4230/LIPIcs.TIME.2019.13\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Time","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4230/LIPIcs.TIME.2019.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

我们研究了满足给定CTL公式的给定有限点Kripke模型的最小化问题，唯一的目的是在得到的简化模型中保持该公式的满足性。我们考虑了该模型中基于状态的冗余和基于公式的冗余的最小化。我们开发了一个计算所有这些最小化的程序，用一些例子进行了说明，并对其进行了一些复杂性分析。

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

查看原文本刊更多论文

Minimisation of Models Satisfying CTL Formulas

We study the problem of minimisation of a given finite pointed Kripke model satisfying a given CTL formula, with the only objective to preserve the satisfaction of that formula in the resulting reduced model. We consider minimisations of the model with respect both to state-based redundancies and formula-based redundancies in that model. We develop a procedure computing all such minimisations, illustrate it with some examples, and provide some complexity analysis for it.

求助全文

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

来源期刊

Time

自引率

0.00%

发文量