Chevron Left
返回到 Automated Reasoning: Symbolic Model Checking

学生对 EIT 数字 提供的 Automated Reasoning: Symbolic Model Checking 的评价和反馈

24 个评分


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

Jun 1, 2020

创建者 P Y

Mar 30, 2022


Oct 29, 2021

创建者 Risheng X

Jan 8, 2021