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
This course is designed for novice learners wanting to understand the basics of how security, orchestration, automation, and response (SOAR) are used for enterprise security. Learners will gain... more
In this lab you will query a large dataset, update the BigQuery API quota, and then optimize your query to run within quota.Created by: Google Cloud more
This course is a partnership between the leading content marketing authority, Copyblogger, and UC Davis Continuing and Professional Education. In this course, you will learn the core strategies... more
This specialization is intended for people with some programming experience who seek an approachable introduction to how operating systems work on a fundamental level. This course will equip... more
Karate is an open-source framework for API Test automation that uses BDD style syntax, has a rich assertion library, built-in HTML reports. In this 2-hour long project-based course, you will learn... more
Powered by
