QQ客服 官方微博 反馈留言

	A new temporal logic CTL[k-QDDC] and its verification
	Zhu, Jiaqi ; Wang, Hanpin ; Xu, Zhongyuan
	2008
英文摘要	We define a new temporal logic called CTL[k-QDDC]. It extends CTL with the ability to specify branching pasts and quantitative temporal properties by combining CTL with the logic Quantified Discrete-time Duration Calculus (QDDC). The idea of bounded model checking is also used in this logic. Compared to CTL, the added expressive power is necessary for specification and verification of real-time distributed software and hardware systems. We give the syntax and semantics of CTL[k-QDDC], discuss its expressive power, and propose an explicit model checking algorithm for Kripke structure. CTL[k-QDDC] is considered as a foundation of some more complex logics for specifying and verifying continuous-time properties in some appropriate structures. ? 2008 IEEE.; EI; 0
语种	英语
DOI标识	10.1109/COMPSAC.2008.53
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/263459]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Zhu, Jiaqi,Wang, Hanpin,Xu, Zhongyuan. A new temporal logic CTL[k-QDDC] and its verification. 2008-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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