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
This series of courses is intended to provide learners with the tools to develop and operate a home-based childcare center. Stages of child development, best practices to stimulate learning,... more
Cloud computing is rapidly expanding into all areas of businesses, creating new and exciting career opportunities. These opportunities cover a broad range of roles, from developers and architects... more
In this course, you will gain an understanding of the theory underlying optimal portfolio construction, the different ways portfolios are actually built in practice and how to measure and manage... more
Hello everyone and welcome to this new hands-on project on AutoML with AutoGluon. In this project, we will use a power library known as AutoGluon to train several machine learning models to solve... more
Finance is one of the key ingredients for successful startups. Many entrepreneurs, however, lack knowledge of finance. This course teaches basic financial knowledge needed in starting and operating... more
Powered by
