Model checking and the Next operator

Video placeholder
Loading...
View Syllabus

Reviews

4.2 (52 ratings)

  • 5 stars
    57.69%
  • 4 stars
    25%
  • 3 stars
    5.76%
  • 2 stars
    5.76%
  • 1 star
    5.76%

From the lesson

Probabilistic Computational Tree Logic

We discuss the syntax and semantics of Probabilistic Computational Tree logic and check out the model checking algorithms that are necessary to decide the validity of different kinds of PCTL formulas. We shortly discuss the complexity of PCTL model checking.

Taught By

  • Placeholder

    Anne Remke

    Prof. dr.

Explore our Catalog

Join for free and get personalized recommendations, updates and offers.