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 today\'s world, software development is highly complex and often has large teams of developers working on small pieces of a larger software project. This course will go over the basic principles... more
This is a self-paced lab that takes place in the Google Cloud console. Data Studio lets you create dynamic, visually compelling reports and dashboards. Watch the short video more
Welcome to our course designed to guide you through interacting with the OpenAI API and making your first API requests. The first course in this specialization focuses on leveraging AI capabilities... more
Through recorded lectures, demonstrations, and hands-on labs, participants explore and deploy the components of a secure Google Cloud solution, including Cloud Identity, the GCP Resource Manager,... more
This third course serves as an introduction to the physics of electricity and magnetism. Upon completion, learners will understand how mathematical laws and conservation principles describe fields... more
Powered by
