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
Welcome to Climate Resilience and Urban Sustainability, the first course in the Building Sustainable Cities Specialization. By completing Climate Resilience and Urban Sustainability, you will gain... more
This course focuses on examining various practical applications of the fundamental financial analysis and valuation techniques employed in the investment banking industry. Specifically, we will... more
This course focuses on JEE as a platform. We discuss the motivation and purpose, as well as some of the frequently used libraries and technologies, in the Java Enterprise Edition. We take a look at... more
Former U.S. Secretary of the Treasury Timothy F. Geithner and Professor Andrew Metrick survey the causes, events, policy responses, and aftermath of the recent global financial crisis.Created by:... more
The course is suited for teaching and learning professionals, media professors, university leaders, and educators interested in learning, creating, and using Digital Case Studies. This course will... more
Powered by
