Automated Reasoning: Symbolic Model Checking
Master symbolic model checking: Learn CTL, BDDs, and algorithms for verifying properties of complex systems efficiently.
Master symbolic model checking: Learn CTL, BDDs, and algorithms for verifying properties of complex systems efficiently.
This course introduces symbolic model checking, a powerful technique for automatically verifying properties of complex systems and programs. It covers Computation Tree Logic (CTL) for describing system properties, Binary Decision Diagrams (BDDs) for efficient representation of boolean functions and state sets, and algorithms for CTL model checking using BDDs. The curriculum progresses from basic concepts to advanced applications, including examples of verifying properties in large state spaces. Students will learn to apply these techniques to real-world problems in system verification.
4.7
(26 ratings)
2,679 already enrolled
Instructors:
English
Powered by
What you'll learn
Understand the principles of model checking and its applications in system verification
Master Computation Tree Logic (CTL) for describing properties of transition systems
Learn the structure and algorithms for Binary Decision Diagrams (BDDs)
Apply BDDs to represent boolean functions and sets of states efficiently
Understand the symbolic model checking algorithm using CTL and BDDs
Gain practical experience in verifying properties of complex systems
Skills you'll gain
This course includes:
2 Hours PreRecorded video
12 assignments
Access on Mobile, Tablet, Desktop
FullTime access
Shareable certificate
Get a Completion Certificate
Share your certificate with prospective employers and your professional network on LinkedIn.
Created by
Provided by
Top companies offer this course to their employees
Top companies provide this course to enhance their employees' skills, ensuring they excel in handling complex projects and drive organizational success.
There are 4 modules in this course
This course provides a comprehensive introduction to symbolic model checking, a powerful technique for automatically verifying properties of complex systems and programs. The curriculum is divided into four modules, covering Computation Tree Logic (CTL), Binary Decision Diagrams (BDDs), and their application in symbolic model checking. Students will learn how to represent and verify properties of transition systems using CTL, understand the structure and algorithms for BDDs, and apply these concepts to symbolic model checking. The course progresses from theoretical foundations to practical applications, including examples of verifying properties in large state spaces. Through a combination of video lectures, quizzes, and practical problems, students will gain both theoretical understanding and hands-on experience in applying these techniques to real-world verification problems.
CTL model checking
Module 1 · 1 Hours to complete
BDDs part 1
Module 2 · 1 Hours to complete
BDDs part 2
Module 3 · 1 Hours to complete
BDD based symbolic model checking
Module 4 · 9 Hours to complete
Fee Structure
Payment options
Financial Aid
Instructor
Acclaimed Academic Specializing in Algorithms and Automated Reasoning
Hans Zantema is an esteemed Associate Professor in the Department of Mathematics and Computer Science at Eindhoven University of Technology (TU/e) and also serves as a part-time Full Professor at Radboud University in Nijmegen. His research expertise spans algorithms, automated reasoning, term rewriting systems, automata theory, and constraint solving systems. He is particularly focused on the theoretical aspects of these fields, exploring how various problems can be transformed into formulas that can be solved automatically through computer programs. Notably, Hans has made significant contributions to term rewriting systems, especially in the area of automatically proving termination, and he is recognized for "Zantema's problem," which questions whether the string rewrite system 0011 → 111000 terminates. Hans earned his PhD in algebraic number theory from the University of Amsterdam in 1983, with a thesis titled "Integer Valued Polynomials in Algebraic Number Theory." Following his graduation, he worked at Philips Data Systems before transitioning to academia. From 1987 to 2000, he was affiliated with Utrecht University, and in 2000, he joined TU/e. He also took on a position at Radboud University in Nijmegen in 2007.
Testimonials
Testimonials and success stories are a testament to the quality of this program and its impact on your career and learning journey. Be the first to help others make an informed decision by sharing your review of the course.
4.7 course rating
26 ratings
Frequently asked questions
Below are some of the most commonly asked questions about this course. We aim to provide clear and concise answers to help you better understand the course content, structure, and any other relevant information. If you have any additional questions or if your question is not listed here, please don't hesitate to reach out to our support team for further assistance.