Minimisation of Models Satisfying CTL Formulas

Time Pub Date : 2019-10-16 DOI:10.4230/LIPIcs.TIME.2019.13
S. Cerrito, Amélie David, V. Goranko
{"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}
引用次数: 0

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
满足CTL公式的模型的最小化
我们研究了满足给定CTL公式的给定有限点Kripke模型的最小化问题,唯一的目的是在得到的简化模型中保持该公式的满足性。我们考虑了该模型中基于状态的冗余和基于公式的冗余的最小化。我们开发了一个计算所有这些最小化的程序,用一些例子进行了说明,并对其进行了一些复杂性分析。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Early Detection of Temporal Constraint Violations LSCPM: communities in massive real-world Link Streams by Clique Percolation Method Taming Strategy Logic: Non-Recurrent Fragments Realizability Problem for Constraint LTL Logical Forms of Chronicles
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1