Automated Reasoning: Symbolic Model Checking
- Offered byCoursera
Automated Reasoning: Symbolic Model Checking at Coursera Overview
Duration | 13 hours |
Start from | Start Now |
Total fee | Free |
Mode of learning | Online |
Difficulty level | Intermediate |
Official Website | Explore Free Course  |
Credential | Certificate |
Automated Reasoning: Symbolic Model Checking at Coursera Highlights
- 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
Automated Reasoning: Symbolic Model Checking at Coursera Course details
- 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.
- Typically, a state space may be very large. One way to deal with this is symbolic model checking: a way in which sets of states are represented symbolically. A fruitful way to do so is by representing sets of states by BDDs (binary decision diagrams).
- Definitions and basic properties of BDDs are presented in this course, and also algorithms to compute them, as they are needed for doing CTL model checking.
Automated Reasoning: Symbolic Model Checking at Coursera Curriculum
CTL model checking
General introduction
Model Checking
Computation Tree Logic
Computation Tree Logic Algorithm
Computation Tree Logic Example
Size of state space
CTL equivalence
CTL example
BDDs part 1
Representing Boolean Functions
Decision Trees
Decision Trees 2
BDDs
Decision tree
Reduced ordered decision tree
ROBDD
BDDs part 2
BDD Examples
BDD Algorithm
BDD algorithm 2
BDD Algorithm Example
BDD quiz 1
BDD quiz 2
BDD algorithm
BDD based symbolic model checking
BDD Algorithm CTL
An example: foxes and rabbits
Deadlock checking in a network
Networks, BMC, conclusions
NuSMV source of foxes and rabbits problem
Introduction
Explanation packet switching networks and file describing routing function
Problem 1: colored marbles
Problem 2: reaching equal values
Problem 3: deadlocks in packet switching networks
Automated Reasoning: Symbolic Model Checking at Coursera Admission Process
Important Dates
Other courses offered by Coursera
Student Forum
Anything you would want to ask experts?