Computation Tree Logic

Sort options

Automated Reasoning: Symbolic Model Checking (Coursera)

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.
No votes yet