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
Learners can expect to acquire advanced skills in leveraging data for financial decision-making, with outcomes including proficiency in risk assessment, investment valuation, and strategic... more
In this lab you will upload existing data (a CSV file) to a Firestore serverless database in the cloud.Created by: Google Cloud more
This course provides you with tools and insights for managing a crisis from a leadership perspective. If you are a leader, or work for one, you will benefit from our examination of issues... more
Machine Learning, often called Artificial Intelligence or AI, is one of the most exciting areas of technology at the moment. We see daily news stories that herald new breakthroughs in facial... more
Powered by
