Automated Reasoning: Symbolic Model Checking
About this Course
The Automated Reasoning: Symbolic Model Checking course presents how the 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 reach-ability 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 the algorithms to compute them, as needed for doing CTL model checking.Created by: EIT Digital
Related Online Courses
The movement of bodies in space (like spacecraft, satellites, and space stations) must be predicted and controlled with precision in order to ensure safety and efficacy. Kinematics is a field that... more
This program provides the skills you need to advance your career in cloud architecture and provides a pathway to earn the industry-recognized Google Cloud Associate Cloud Engineer certification.... more
The Introduction to Environmental Science course explores the field of environmental science and encourages participants to understand how environmental scientists think. It addresses some... more
Welcome Designers! In this course, you will learn to use the most important tools from the field of human-centered design to generate ideas: stakeholder mapping, journey mapping, personas,... more
The core of the first course is to learn how companies record total costs and calculate unit costs for their individual products or services. For example, how can a car manufacturer figure out the... more
Powered by
