Welcome!

Loading...
查看授課大綱

審閱

4.3(42 個評分)
  • 5 stars
    62%
  • 4 stars
    26%
  • 2 stars
    5%
  • 1 star
    7%
從本節課中
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.

探索我們的目錄

免費加入並獲得個性化推薦、更新和優惠。