The Always Operator

Loading...
来自 EIT 数字 的课程
Quantitative Model Checking
19 评分
EIT 数字
19 评分
从本节课中
Module 1: Computational Tree Logic
We introduce Labeled Transition Systems (LTS), the syntax and semantics of Computational Tree Logic (CTL) and discuss the model checking algorithms that are necessary to compute the satisfaction set for specific CTL formulas.

与讲师见面

  • Anne Remke
    Anne Remke
    Prof. dr.
    Computer Science