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.
от партнера
Automated Reasoning: Symbolic Model Checking
EIT DigitalОб этом курсе
Недавно просмотрено: 2,948
Сертификат, ссылками на который можно делиться с другими людьми
Получите сертификат по завершении
100% онлайн
Начните сейчас и учитесь по собственному графику.
Гибкие сроки
Назначьте сроки сдачи в соответствии со своим графиком.
Промежуточный уровень
Basic logic and programming on a bachelor level.
Прибл. 13 часов на выполнение
Английский
Субтитры: Английский
Сертификат, ссылками на который можно делиться с другими людьми
Получите сертификат по завершении
100% онлайн
Начните сейчас и учитесь по собственному графику.
Гибкие сроки
Назначьте сроки сдачи в соответствии со своим графиком.
Промежуточный уровень
Basic logic and programming on a bachelor level.
Прибл. 13 часов на выполнение
Английский
Субтитры: Английский
от партнера
EIT Digital
EIT Digital is a pan-European organization whose mission is 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 talents for the future.
Программа курса: что вы изучите
1 ч. на завершение
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 ч. на завершение
5 видео ((всего 44 мин.))
5 видео
Model Checking9мин
Computation Tree Logic11мин
Computation Tree Logic Algorithm10мин
Computation Tree Logic Example7мин
3 практических упражнения
Size of state space10мин
CTL equivalence10мин
CTL example10мин
1 ч. на завершение
BDDs part 1
In this module BDDs (binary decision diagrams) are introduced as decision trees with sharing. They represent boolean functions.
1 ч. на завершение
4 видео ((всего 33 мин.))
3 практических упражнения
Decision tree10мин
Reduced ordered decision tree10мин
ROBDD10мин
2 ч. на завершение
BDDs part 2
After some examples of BDD, the algorithm is presented and discussed to compute the ROBDD of any propositional formula.
2 ч. на завершение
4 видео ((всего 35 мин.))
3 практических упражнения
BDD quiz 120мин
BDD quiz 220мин
BDD algorithm30мин
9 ч. на завершение
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 ч. на завершение
4 видео ((всего 39 мин.)), 3 материалов для самостоятельного изучения, 3 тестов
4 видео
An example: foxes and rabbits8мин
Deadlock checking in a network10мин
Networks, BMC, conclusions10мин
3 материала для самостоятельного изучения
NuSMV source of foxes and rabbits problem10мин
Introduction10мин
Explanation packet switching networks and file describing routing function1ч 10мин
3 практических упражнения
Problem 1: colored marbles1ч
Problem 2: reaching equal values2ч
Problem 3: deadlocks in packet switching networks4ч
Часто задаваемые вопросы
When will I have access to the lectures and assignments?
Access to lectures and assignments depends on your type of enrollment. If you take a course in audit mode, you will be able to see most course materials for free. To access graded assignments and to earn a Certificate, you will need to purchase the Certificate experience, during or after your audit. If you don't see the audit option:
The course may not offer an audit option. You can try a Free Trial instead, or apply for Financial Aid.
The course may offer 'Full Course, No Certificate' instead. This option lets you see all course materials, submit required assessments, and get a final grade. This also means that you will not be able to purchase a Certificate experience.
What will I get if I purchase the Certificate?
When you purchase a Certificate you get access to all course materials, including graded assignments. Upon completing the course, your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile. If you only want to read and view the course content, you can audit the course for free.
What is the refund policy?
You will be eligible for a full refund until two weeks after your payment date, or (for courses that have just launched) until two weeks after the first session of the course begins, whichever is later. You cannot receive a refund once you’ve earned a Course Certificate, even if you complete the course within the two-week refund period. See our full refund policy.
Is financial aid available?
Yes, Coursera provides financial aid to learners who cannot afford the fee. Apply for it by clicking on the Financial Aid link beneath the "Enroll" button on the left. You’ll be prompted to complete an application and will be notified if you are approved. Learn more.
Остались вопросы? Посетите Центр поддержки учащихся.
© Coursera Inc., 2020 Все права защищены.
