The Until Operator

From the course by EIT Digital
Quantitative Model Checking
26 ratings
EIT Digital
26 ratings
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.

Meet the Instructors

  • Anne Remke
    Anne Remke
    Prof. dr.
    Computer Science

Explore our Catalog

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