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 learning path offers a comprehensive introduction to generative AI. This specialization exploes the foundations of large language models (LLMs), their diverse applications, and the ethical... more
By the end of the project, you will learn how to quantify risk-to-reward using Treynor Ratio, and calculate the value at risk for investment portfolio. ATTENTION: To take this course, it is... more
\"Snowflake - SnowPro Core Certification Preparation\" is a comprehensive course meticulously crafted to guide learners through the essentials of Snowflake, preparing them for the SnowPro Core... more
This specialization is designed to be an introduction to additive manufacturing (AM) with exposure to six different AM processes. The field of AM can be broadly divided into three elements:... more
This course starts with an introduction to Python programming, covering everything from installation and setup of Python and Anaconda to fundamental concepts such as variables, numeric and logical... more
Powered by
