Institutional Repository
| the complexity of dual models problem of propositional linear temporal logics | |
| Wu Zhi-Lin; Zhang Wen-Hui | |
| 2007 | |
| Source | Ruan Jian Xue Bao/Journal of Software
![]() |
| ISSN | 10009825 |
| Volume | 18Issue:7Pages:1573-1581 |
| Indexed Type | EI |
| Keyword | Computational Complexity Mathematical Operators Model Checking |
| Department | (1) State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China |
| Language | 中文 |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/11412 |
| Collection | 基础软件与系统重点实验室 |
| Recommended Citation GB/T 7714 | Wu Zhi-Lin,Zhang Wen-Hui. the complexity of dual models problem of propositional linear temporal logics[J]. Ruan Jian Xue Bao/Journal of Software,2007,18(7):1573-1581. |
| APA | Wu Zhi-Lin,&Zhang Wen-Hui.(2007).the complexity of dual models problem of propositional linear temporal logics.Ruan Jian Xue Bao/Journal of Software,18(7),1573-1581. |
| MLA | Wu Zhi-Lin,et al."the complexity of dual models problem of propositional linear temporal logics".Ruan Jian Xue Bao/Journal of Software 18.7(2007):1573-1581. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| 1573.pdf(335KB) | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment