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
Master the art of modern Java application development with the Spring Framework. This comprehensive course takes you from beginner to advanced levels, offering an in-depth understanding of... more
Athletes, lawyers and team executive experts provide insight in how law and regulations intersect with data analytics and sports management techniques for best practices in the sports industry.... more
Introduces how to measure and manage a workforce strategically, including (1) identifying the strategic work that is truly necessary to execute firm strategy; (2) investing in differentiated... more
The Robotic Process Automation (RPA) specialization offers comprehensive knowledge and professional-level skills focused on developing and deploying software robots. It starts with the basic... more
Learn the strategies to share your message with audiences of any size, and plan your message type based on your communication goals!Created by: Arizona State University more
Powered by
