This course presents how 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 reachability can be described.
ofrecido por
Automated Reasoning: Symbolic Model Checking
EIT DigitalAcerca de este Curso
4554 vistas recientes
Fechas lÃmite flexibles
Restablece las fechas lÃmite en función de tus horarios.
Certificado para compartir
Obtén un certificado al finalizar
100Â % en lÃnea
Comienza de inmediato y aprende a tu propio ritmo.
Nivel intermedio
Basic logic and programming on a bachelor level.
Aprox. 13 horas para completar
Inglés (English)
SubtÃtulos: Inglés (English)
Fechas lÃmite flexibles
Restablece las fechas lÃmite en función de tus horarios.
Certificado para compartir
Obtén un certificado al finalizar
100Â % en lÃnea
Comienza de inmediato y aprende a tu propio ritmo.
Nivel intermedio
Basic logic and programming on a bachelor level.
Aprox. 13 horas para completar
Inglés (English)
SubtÃtulos: Inglés (English)
ofrecido por
EIT Digital
EIT Digital is a European education and innovation organisation with a mission to foster digital technology innovation and entrepreneurial talent for economic growth and quality of life. By linking education, research, and business, EIT Digital empowers digital top talent for the future.
Programa - Qué aprenderás en este curso
1 hora para completar
CTL model checking
After a general introduction to the MOOC, this module starts by a general description of model checking.Then Computation Tree Logic (CTL) is introduced: a language in which properties on transition systems can be described. The algorithm to check whether such a property holds is given in an abstract setting, leaving implicit how sets of states are represented.
1 hora para completar
5 videos (Total 44 minutos)
1 hora para completar
BDDs part 1
In this module BDDs (binary decision diagrams) are introduced as decision trees with sharing. They represent boolean functions.
1 hora para completar
4 videos (Total 33 minutos)
2 horas para completar
BDDs part 2
After some examples of BDD, the algorithm is presented and discussed to compute the ROBDD of any propositional formula.
2 horas para completar
4 videos (Total 35 minutos)
9 horas para completar
BDD based symbolic model checking
In this last module the topics of CTL model checking and BDDs are combined: it is shown how BDDs can be used to represent sets of states in a way that the abstract algorithm for CTL mode checking can be used, and much larger state spaces can be dealt with than by using explicit state based model checking. Sever examples are presented.
9 horas para completar
4 videos (Total 39 minutos), 3 lecturas, 3 cuestionarios
Preguntas Frecuentes
¿Cuándo podré acceder a las lecciones y tareas?
¿Qué recibiré si compro el Certificado?
¿Hay ayuda económica disponible?
¿Tienes más preguntas? Visita el Centro de Ayuda al Alumno.
