Welcome!

video-placeholder
Loading...
View Syllabus

Reviews

4.2 (51 ratings)

  • 5 stars
    56.86%
  • 4 stars
    25.49%
  • 3 stars
    5.88%
  • 2 stars
    5.88%
  • 1 star
    5.88%

From the lesson

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.

Taught By

  • Placeholder

    Anne Remke

    Prof. dr.

Explore our Catalog

Join for free and get personalized recommendations, updates and offers.