中英▼
go top

computation tree logic

  • 计算树逻辑

专业释义英英释义

  • 计算树逻辑 - 引用次数：9

    This paper introduces the past temporal operators into computation tree logic(CTL),and obtains a new specification language CTLP which is more expressive than CTL.

    在计算树逻辑(CTL)中引入过去时态算子,得到了表达力更强的属性规约语言CTLP,给出了CTLP的模型检测算法及其固定点刻画。

    参考来源 - 具有过去时态算子的计算树逻辑模型检测 in C

·2,447,543篇论文数据，部分数据来源于NoteExpress

Computation tree logic

  • abstract: Computation tree logic (CTL) is a branching-time logic, meaning that its model of time is a tree-like structure in which the future is not determined; there are different paths in the future, any one of which might be an actual path that is realised. It is used in formal verification of software or hardware artifacts, typically by software applications known as model checkers which determine if a given artifact possesses safety or liveness properties.

以上来源于: WordNet

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块？

感谢您的反馈，我们会尽快进行适当修改！
进来说说原因吧 确定
小调查
请问您想要如何调整此模块？

感谢您的反馈，我们会尽快进行适当修改！
进来说说原因吧 确定