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
Lactation and especially milk, which is the product of that unique mammalian process, are routinely encountered within our daily lives. Nevertheless, they often are poorly understood by many, even... more
How are all of the species living on Earth today related? How does understanding evolutionary science contribute to our well-being? In this course, participants will learn about evolutionary... more
This Specialized Program is aimed at leaders who are interested in consolidating their leadership and critical thinking skills within an organization, positively impacting organizational behavior... more
This Specialization will introduce you to the magic of 3D printing. Through a series of four cohesive courses and a hands-on capstone experience, you will acquire the knowledge and skills to turn... more
This course presents the different customer interactions that happen in a retail setting and allows you to experience real interactions through simulations and scenarios. Interactions examined... more
Powered by
