The Automated Reasoning: Symbolic Model Checking course presents how the 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 reach-ability can be described.

Automated Reasoning: Symbolic Model Checking

Automated Reasoning: Symbolic Model Checking

Instructor: Hans Zantema
2,900 already enrolled
Included with
26 reviews
Recommended experience
What you'll learn
Understand the foundations of symbolic model checking and automated system verification.
Represent and verify systems using transition systems and Computation Tree Logic
Apply CTL model checking algorithms to automatically check correctness properties
Learn how Binary Decision Diagrams (BDDs) efficiently represent Boolean functions and large state spaces.
Details to know

Add to your LinkedIn profile
12 assignments
See how employees at top companies are mastering in-demand skills

There are 4 modules in this course
Instructor

Offered by
Explore more from Software Development
- Status: Free Trial
University of Colorado Boulder

28DIGITAL

28DIGITAL
Status: Free TrialUniversity of Colorado Boulder
Why people choose Coursera for their career

Felipe M.

Jennifer J.

Larry W.

Chaitanya A.

Open new doors with Coursera Plus
Unlimited access to 10,000+ world-class courses, hands-on projects, and job-ready certificate programs - all included in your subscription
Advance your career with an online degree
Earn a degree from world-class universities - 100% online
Join over 3,400 global companies that choose Coursera for Business
Upskill your employees to excel in the digital economy

