Institutional Repository
| 命题线性时序逻辑的对偶模型问题的复杂性 | |
| Alternative Title | the complexity of dual models problem of propositional linear temporal logics |
| 吴志林; 张文辉 | |
| 2007 | |
| Source | 软件学报
 |
| Volume | 18Issue:7 |
| Indexed Type | wanfang |
| Keyword | 命题线性时序逻辑 对偶模型 计算复杂性 Propositionallineartemporallogic Dualmodel Computationalcomplexity |
| Department | 计算机科学国家重点实验室 |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/4656 |
| Collection | 基础软件与系统重点实验室 |
| Recommended Citation GB/T 7714 | 吴志林,张文辉. 命题线性时序逻辑的对偶模型问题的复杂性[J]. 软件学报,2007,18(7). |
| APA | 吴志林,&张文辉.(2007).命题线性时序逻辑的对偶模型问题的复杂性.软件学报,18(7). |
| MLA | 吴志林,et al."命题线性时序逻辑的对偶模型问题的复杂性".软件学报 18.7(2007). |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| 7.pdf（273KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment