Automated Reasoning: Symbolic Model Checking
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 also algorithms to compute them, as they are needed for doing CTL model checking.
- Fecha Incio:16/03/2020
- Idioma: Inglés
- Universidad: EIT Digital
- Profesores: Hans Zantema
- Certificado: No