on model construction for modal mu-calculus
文献类型：会议论文
| 作者 | Qu Nan |
| 出版日期 | 2012 |
| 会议名称 | IEEE 6th International Symposium on Theoretical Aspects of Software Engineering, TASE 2012 |
| 会议日期 | July 4, 2012 - July 6, 2012 |
| 会议地点 | Beijing, China |
| 关键词 | Formal logic Software engineering |
| 页码 | 257-260 |
| 中文摘要 | 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 IEEE. |
| 英文摘要 | 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 IEEE. |
| 收录类别 | EI |
| 会议主办者 | IFIP; Beijing University of Technology |
| 会议录 | Proceedings - IEEE 6th International Symposium on Theoretical Aspects of Software Engineering, TASE 2012
 |
| 语种 | 英语 |
| ISBN号 | 9780769547510 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/15794]  |
| 专题 | 软件研究所_软件所图书馆_会议论文 |
| 推荐引用方式 GB/T 7714 | Qu Nan. on model construction for modal mu-calculus[C]. 见:IEEE 6th International Symposium on Theoretical Aspects of Software Engineering, TASE 2012. Beijing, China. July 4, 2012 - July 6, 2012. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。