Chevron Left
返回到 Automated Reasoning: Symbolic Model Checking

學生對 EIT 数字 提供的 Automated Reasoning: Symbolic Model Checking 的評價和反饋

4.7
22 個評分

課程概述

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....
篩選依據:

1 - Automated Reasoning: Symbolic Model Checking 的 4 個評論(共 4 個)

創建者 pradeep r

2020年6月1日

Good to learn about Model checking concepts.

創建者 P Y

2022年3月30日

it was good and i learning so much here

創建者 TAPASWINI A P

2021年10月29日

very nice

創建者 Risheng X

2021年1月8日

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