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
Amazon Elastic File System offers a simple interface that allows you to create and configure file systems quickly and easily in AWS. By the end of this project, you will get a real world experience... more
This Specialization is designed to help you navigate the complex legal framework that governs modern health systems. You will learn the fundamentals of American health law, then explore how privacy... more
Defying Disruption: How to Become an Un-Disruptable Leader is a collaboration between Parsons School of Design at The New School and Mark Lipton LLC.\\n\\nIn the Defying Disruption: How to Become... more
This course familiarizes you with standards and policies of the electric utility industry, and provides you with basic vocabulary used in the business. It introduces the electric power system, from... more
This course explores the developments that have fueled the emergence of fintech companies around the world. Following the changing regulatory environment, especially since the 1997 Asian and 2008... more
Powered by
