Chevron Left
Automated Reasoning: Symbolic Model Checking に戻る

EIT Digital による Automated Reasoning: Symbolic Model Checking の受講者のレビューおよびフィードバック

4.6
16件の評価
3件のレビュー

コースについて

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. 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....
フィルター:

Automated Reasoning: Symbolic Model Checking: 1 - 3 / 3 レビュー

by pradeep r

2020年6月1日

Good to learn about Model checking concepts.

by TAPASWINI A P

2021年10月29日

very nice

by Risheng X

2021年1月8日

Actually the contents are orgnized quite well, but it seems no one has answered the questions in Discussion Forum.