Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Online Course

Model Checking

Chennai Mathematical Institute and NPTEL via Swayam

(0)
27

Taken this course? Share your experience with other students. Write review

Overview

Embedded software control many of the safety-critical systems that we deal with in everyday life: for instance, modern cars are equipped with software to automatically change gears; pacemakers come with a software controller to regulate heart beat; aircrafts have flight control software, and so on. Typically, these (software) controllers have to make decisions based on inputs coming from multiple interacting components. As the size and the number of interacting components increase, the design and verification of controllers becomes increasingly complex.
Model checking is a field of research that addresses this challenge by making use of mathematical models in the design and verification of controllers. The main idea is to look at the system as a mathematical model - commonly used models are extensions of finite-state machines. Design requirements on the controller then get translated to suitable questions on these mathematical models.The goal of this course is to understand some of the techniques and tools used in the process of model-checking.

INTENDED AUDIENCE : This course would be relevant to CSE/EE/ECE/IT students. It would also cater to engineers in the industry who are looking forward to rigorous design and testing methods.PREREQUISITES : Familiarity with basic algorithms and finite-state machines preferableINDUSTRY SUPPORT : NIL

Syllabus

COURSE LAYOUT

Week 1: Modeling systems as Finite-state machines
Week 2: Using the model-checker NuSMV
Week 3: Linear-time properties for verification
Week 4: Regular properties – automata over finite words
Week 5: Omega-regular properties – automata over infinite words
Week 6: Model checking omega-regular properties
Week 7: Linear Temporal Logic (LTL)
Week 8: Algorithms for LTL
Week 9: Computation Tree Logic (CTL)
Week 10: Algorithms for CTL
Week 11: Binary Decision Diagrams (BDDs)
Week 12: Models with timing constraints – timed automataRegular properties – automata over finite words

Taught by

B. Srivathsan

Reviews for Swayam's Model Checking Based on 0 reviews

  • 5 star 0%
  • 4 star 0%
  • 3 star 0%
  • 2 star 0%
  • 1 star 0%

Did you take this course? Share your experience with other students.

Write a review

Class Central

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free

Never stop learning Never Stop Learning!

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free