中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
the complexity of dual models problem of propositional linear temporal logics

文献类型:期刊论文

作者Wu Zhi-Lin ; Zhang Wen-Hui
刊名Ruan Jian Xue Bao/Journal of Software
出版日期2007
卷号18期号:7页码:1573-1581
关键词Computational complexity Mathematical operators Model checking
ISSN号10009825
收录类别EI
语种中文
公开日期2011-07-01
附注In this paper, the concept of dual models of a propositional linear temporal logic formula is defined: A formula f has dual models if it has two models (namely two ω-sequences of states) such that the assignments to atomic propositions at each posit
源URL[http://124.16.136.157/handle/311060/11412]  
专题软件研究所_计算机科学国家重点实验室 _期刊论文
推荐引用方式
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.

入库方式: OAI收割

来源:软件研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。