Welcome!

Loading...
查看授课大纲

审阅

4.3(46 个评分)
  • 5 stars
    58.69%
  • 4 stars
    26.08%
  • 3 stars
    4.34%
  • 2 stars
    4.34%
  • 1 star
    6.52%
从本节课中
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.

教学方

  • Placeholder

    Anne Remke

    Prof. dr.

探索我们的目录

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