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
Interested in decarbonisation, high performance, and climate resilient buildings? Then this course is for you. Our future is low-carbon, net-zero buildings that are super-efficient and... more
Did you know that personalized product recommendations can increase sales by up to 20%? As consumers, we all appreciate suggestions tailored to our tastes, and as AI engineers, we can harness data... more
Python is one of the most popular and widely-used programming languages in the world due to its high usability and large collection of libraries. This learning path provides an application-driven... more
This course equips learners with the skills to analyze dynamic relationships within systems, create causal loop diagrams, and simulate the behavior of interconnected variables. Participants gain... more
This specialization is intended for salespeople who want to take their skills to the next level. It uses an approach that includes the latest best practices from empirically-driven research and... more
Powered by
