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
In this course, you will see how web apps in Azure allow you to publish and manage your website easily without having to work with the underlying servers, storage, or network assets. Instead, you... more
This specialization is intended for researchers or research enthusiasts of all different levels to help them know what their omic data means and how to learn about it! With an overhwelming... more
This is the second course in the four-course specialization Python Data Products for Predictive Analytics, building on the data processing covered in Course 1 and introducing the basics of... more
The effects of climate change have prompted individuals and institutions to evaluate their impact on our planet. In this specialization, learn how you and global companies can reduce the harmful... more
In this hands-on specialization, you will explore basic graphic design elements, color theory, images, publication design and techniques for creating effective layouts. You will also learn about... more
Powered by
