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
Exam AZ-104: Microsoft Certified Azure Administrator Associate is an intermediate-level certification exam from Microsoft for those who are working as System engineers, or administrators. It is an... more
This Specialization is intended for professionals who seek to improve their management competencies and skills. Through five courses, you will cover Delphi Method, Scenario Planning, Models and... more
This is a self-paced lab that takes place in the Google Cloud console. Lab has instructions to conduct distributed load testing with Kubernetes, which includes a sample web application, Docker... more
This course uses the latest mobile technology and job tools like React Native, JavaScript, Expo-GO, and 2023 conventions, teaching advanced mobile development with React hooks. In this course, you... more
This Specialization explains high level patterns used in Microservice architectures and the motivation to move towards these architectures and away from monolithic development of applications.... more
Powered by
