Model Checking CTL

Loading...
From the course by EIT Digital
Quantitative Model Checking
14 ratings
EIT Digital

Quantitative Model Checking

14 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
Coursera provides universal access to the world’s best education, partnering with top universities and organizations to offer courses online.
© 2017 Coursera Inc. All rights reserved.
Download on the App StoreGet it on Google Play