Unbounded Until

Loading...
来自 EIT Digital 的课程
Quantitative Model Checking
21 评分
EIT Digital
21 评分
从本节课中
Probabilistic Computational Tree Logic
We discuss the syntax and semantics of Probabilistic Computational Tree logic and check out the model checking algorithms that are necessary to decide the validity of different kinds of PCTL formulas. We shortly discuss the complexity of PCTL model checking.

与讲师见面

  • Anne Remke
    Anne Remke
    Prof. dr.
    Computer Science

探索我们的目录

免费加入并获得个性化推荐、更新和优惠。