模态微积分的模型构造

2012 Sixth International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2012-07-04 DOI:10.1109/TASE.2012.49

Nan Qu

{"title":"模态微积分的模型构造","authors":"Nan Qu","doi":"10.1109/TASE.2012.49","DOIUrl":null,"url":null,"abstract":"This paper presents a tableau system for checking satisfiability of modal μ-calculus formulas. When a formula F is satisfiable, a model with size bounded by 2[F] can be extracted from the tableau. We also show that the asymptotic lower bound for the model size of formulas is greater than any polynomial function of the size of formulas.","PeriodicalId":417979,"journal":{"name":"2012 Sixth International Symposium on Theoretical Aspects of Software Engineering","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On model construction for modal mu-calculus\",\"authors\":\"Nan Qu\",\"doi\":\"10.1109/TASE.2012.49\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a tableau system for checking satisfiability of modal μ-calculus formulas. When a formula F is satisfiable, a model with size bounded by 2[F] can be extracted from the tableau. We also show that the asymptotic lower bound for the model size of formulas is greater than any polynomial function of the size of formulas.\",\"PeriodicalId\":417979,\"journal\":{\"name\":\"2012 Sixth International Symposium on Theoretical Aspects of Software Engineering\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-07-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Sixth International Symposium on Theoretical Aspects of Software Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TASE.2012.49\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Sixth International Symposium on Theoretical Aspects of Software Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TASE.2012.49","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文提出了一种验证模态μ微积分公式可满足性的表格系统。当公式F满足时，可以从表中提取出一个以2[F]为界的模型。我们还证明了公式的模型大小的渐近下界大于公式大小的任何多项式函数。

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

查看原文本刊更多论文

On model construction for modal mu-calculus

This paper presents a tableau system for checking satisfiability of modal μ-calculus formulas. When a formula F is satisfiable, a model with size bounded by 2[F] can be extracted from the tableau. We also show that the asymptotic lower bound for the model size of formulas is greater than any polynomial function of the size of formulas.

求助全文

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

来源期刊

2012 Sixth International Symposium on Theoretical Aspects of Software Engineering

自引率

0.00%

发文量