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
At the global level, there are many countries marked by violence affecting health care. The \'Health care in danger\' project aims to establish practical measures and recommendations that can be... more
This is a self-paced lab that takes place in the Google Cloud console. In this lab you learn how to use Gemini code generation, explanation and suggestions in BigQuery.Created by: Google Cloud more
Translational science seeks to speed up the process of moving research discoveries from the laboratory into healthcare practices. Numerous scientific and organizational roadblocks can act as... more
In this course, you will learn how to view important information about AWS CloudFormation stacks. Use this information to help troubleshoot common issues and provide effective support case details... more
Embark on a comprehensive journey into the world of IT security with this in-depth course. Learn to safeguard systems, data, and identities while mastering the foundational principles and advanced... more
Powered by
