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
The biggest challenge facing the hospitality industry over the next 5 years is the lack of integration between the key commercial disciplines of sales, revenue, distribution and finance and the... more
This Specialization from leading researchers at the University of Washington introduces you to the exciting, high-demand field of Machine Learning. Through a series of practical case studies, you... more
This is a self-paced lab that takes place in the Google Cloud console. In this lab, you will explore the Vertex AI Embeddings API for both Text and Multimodal (Images and Video) use cases.Created... more
This course examines how the idea of \"the modern\" develops at the end of the 18th century in European philosophy and literature, and how being modern (or progressive, or hip) became one of the... more
This course introduces the Cloud Run serverless platform for running applications. In this course, you learn about the fundamentals of Cloud Run, its resource model and the container lifecycle. You... more
Powered by
