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
Around the world, we find ourselves facing global epidemics of obesity, Type 2 Diabetes and other predominantly diet-related diseases. To address these public health crises, we urgently need to... more
This specialisation introduces students to the emerging and multidisciplinary field of digital health and the role and application of digital health technologies including mobile applications,... more
This specialisation covers topics ranging from basic computing principles to the mathematical foundations required for computer science. You will learn fundamental concepts of how computers work,... more
This comprehensive course will guide students through the process of building a complete web application using MongoDB, Express.js, AngularJS, and Node.js. In the first module, you will explore the... more
In this exciting online course you can understand how technology, strategy and digital business models are important to be innovative in your job. Also, you will understand what disruption is and... more
Powered by
