Time-bounded Until

Loading...
EIT 数字
4.2(27 个评分) | 3.1K 名学生已注册
查看授课大纲

审阅

4.2(27 个评分)
  • 5 stars
    16 ratings
  • 4 stars
    7 ratings
  • 2 stars
    2 ratings
  • 1 star
    2 ratings
从本节课中
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.

探索我们的目录

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