This course presents how properties of acting systems and programs can be verified automatically. The basic notion is a transition system: any system that can be described by states and steps. We present how in CTL (computation tree logic) properties like reachability can be described.
Automated Reasoning: Symbolic Model Checking
Offered By
Automated Reasoning: Symbolic Model Checking
EIT Digital
About this Course
1,546 recent views
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Flexible deadlines
Reset deadlines in accordance to your schedule.
Intermediate Level
Basic logic and programming on a bachelor level.
Approx. 13 hours to complete
English
Subtitles: English
Syllabus - What you will learn from this course
1 hour to complete
CTL model checking
After a general introduction to the MOOC, this module starts by a general description of model checking.Then Computation Tree Logic (CTL) is introduced: a language in which properties on transition systems can be described. The algorithm to check whether such a property holds is given in an abstract setting, leaving implicit how sets of states are represented.
1 hour to complete
5 videos (Total 44 min)
5 videos
Model Checking9m
Computation Tree Logic11m
Computation Tree Logic Algorithm10m
Computation Tree Logic Example7m
3 practice exercises
Size of state space10m
CTL equivalence10m
CTL example10m
1 hour to complete
BDDs part 1
In this module BDDs (binary decision diagrams) are introduced as decision trees with sharing. They represent boolean functions.
1 hour to complete
4 videos (Total 33 min)
3 practice exercises
Decision tree10m
Reduced ordered decision tree10m
ROBDD10m
2 hours to complete
BDDs part 2
After some examples of BDD, the algorithm is presented and discussed to compute the ROBDD of any propositional formula.
2 hours to complete
4 videos (Total 35 min)
3 practice exercises
BDD quiz 120m
BDD quiz 220m
BDD algorithm30m
9 hours to complete
BDD based symbolic model checking
In this last module the topics of CTL model checking and BDDs are combined: it is shown how BDDs can be used to represent sets of states in a way that the abstract algorithm for CTL mode checking can be used, and much larger state spaces can be dealt with than by using explicit state based model checking. Sever examples are presented.
9 hours to complete
4 videos (Total 39 min), 3 readings, 3 quizzes
4 videos
An example: foxes and rabbits8m
Deadlock checking in a network10m
Networks, BMC, conclusions10m
3 readings
NuSMV source of foxes and rabbits problem10m
Introduction10m
Explanation packet switching networks and file describing routing function1h 10m
3 practice exercises
Problem 1: colored marbles1h
Problem 2: reaching equal values2h
Problem 3: deadlocks in packet switching networks4h
Offered by
EIT Digital
EIT Digital is a pan-European organization whose mission is to foster digital technology innovation and entrepreneurial talent for economic growth and quality of life. By linking education, research and business, EIT Digital empowers digital top talents for the future.
Frequently Asked Questions
When will I have access to the lectures and assignments?
Once you enroll for a Certificate, you’ll have access to all videos, quizzes, and programming assignments (if applicable). Peer review assignments can only be submitted and reviewed once your session has begun. If you choose to explore the course without purchasing, you may not be able to access certain assignments.
What will I get if I purchase the Certificate?
When you purchase a Certificate you get access to all course materials, including graded assignments. Upon completing the course, your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile. If you only want to read and view the course content, you can audit the course for free.
What is the refund policy?
Is financial aid available?
More questions? Visit the Learner Help Center.