Institutional Repository
| on model construction for modal mu-calculus | |
| Qu Nan | |
| 2012 | |
| Conference Name | IEEE 6th International Symposium on Theoretical Aspects of Software Engineering, TASE 2012 |
| Source | Proceedings - IEEE 6th International Symposium on Theoretical Aspects of Software Engineering, TASE 2012 |
| Pages | 257-260 |
| Conference Date | July 4, 2012 - July 6, 2012 |
| Conference Place | Beijing, China |
| Indexed Type | EI |
| ISBN | 9780769547510 |
| Department | (1) Institute of Software Chinese Academy of Sciences Graduate School of Chinese Academy of Sciences P.O.Box 8718 100190 Beijing China |
| English 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. © 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. |
| Keyword | Formal Logic Software Engineering |
| Sponsorship | IFIP; Beijing University of Technology |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/15794 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Qu Nan. on model construction for modal mu-calculus[C],2012:257-260. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment