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....
필터링 기준:

Automated Reasoning: Symbolic Model Checking의 4개 리뷰 중 1~4

교육 기관: pradeep r

2020년 6월 1일

교육 기관: P Y

2022년 3월 30일

교육 기관: TAPASWINI A P

2021년 10월 29일

교육 기관: Risheng X

2021년 1월 8일