Coursera
Coursera Logo

Quantitative Model Checking 

  • Offered byCoursera
  • Public/Government Institute

Quantitative Model Checking
 at 
Coursera 
Overview

Duration

18 hours

Total fee

Free

Mode of learning

Online

Difficulty level

Intermediate

Official Website

Explore Free Course External Link Icon

Credential

Certificate

Quantitative Model Checking
Table of content
Accordion Icon V3
  • Overview
  • Highlights
  • Course Details
  • Curriculum

Quantitative Model Checking
 at 
Coursera 
Highlights

  • Earn a shareable certificate upon completion.
  • Flexible deadlines according to your schedule.
Details Icon

Quantitative Model Checking
 at 
Coursera 
Course details

More about this course
  • The integration of ICT (information and communications technology) in different applications is rapidly increasing in e.g. Embedded and Cyber physical systems, Communication protocols and Transportation systems. Hence, their reliability and dependability increasingly depends on software. Defects can be fatal and extremely costly (with regards to mass-production of products and safety-critical systems).
  • First, a model of the real system has to be built. In the simplest case, the model reflects all possible states that the system can reach and all possible transitions between states in a (labelled) State Transition System. When adding probabilities and discrete time to the model, we are dealing with so-called Discrete-time Markov chains which in turn can be extended with continuous timing to Continuous-time Markov chains. Both formalisms have been used widely for modeling and performance and dependability evaluation of computer and communication systems in a wide variety of domains. These formalisms are well understood, mathematically attractive while at the same time flexible enough to model complex systems.
  • Model checking focuses on the qualitative evaluation of the model. As formal verification method, model checking analyzes
  • the functionality of the system model. A property that needs to be analyzed has to be specified in a logic with consistent syntax and semantics. For every state of the model, it is then checked whether the property is valid or not.
  • The main focus of this course is on quantitative model checking for Markov chains, for which we will discuss efficient computational algorithms. The learning objectives of this course are as follows:
  • - Express dependability properties for different kinds of transition systems .
  • - Compute the evolution over time for Markov chains.
  • - Check whether single states satisfy a certain formula and compute the satisfaction set for properties.
Read more

Quantitative Model Checking
 at 
Coursera 
Curriculum

Module 1: Computational Tree Logic

Welcome!

Introduction

Semantics of CTL

Model Checking CTL

The Until Operator

The Always Operator

Script 1 and 2.1

Script 2.2 and 2.3

Script 2.4

Formulate for yourself

Test your understanding of CTL semantics

Check your understanding of CTL

Model checking eventually, always and until

Discrete Time Markov Chains

Introduction to DTMCs

Evolution in Time

Transient probabilities

State classification

Steady-state probabilities

Script 3.1 and 3.2

Script 3.3

Evolution of DTMCs

Compute transient probabilities

Classification of DTMC states True or False?

State classification

Steady-state computation

Probabilistic Computational Tree Logic

Syntax of PCTL

Model checking and the Next operator

Time-bounded Until

Backwards computation

Unbounded Until

Script: 4.1 and 4.2

Script: 4.3.1 and 4.3.2

Script 4.3.3

PCTL Syntax

Checking PCTL next

Test your understanding of PCTL Until

Checking time-bounded until

Checking unbounded until

Test your understanding of PCTL

Continuous Time Markov Chains

Definition of a CTMC

Generator matrix

Steady-state probabilities

Triple Modular Redundancy

Uniformisation

Script: 5.1 and 5.2

Script: 5.3

Generator matrix

Test your understanding of CTMCs

Steady state probability in CTMCs

Identifying BSCCs

Test your understanding of Uniformisation

Uniformisation

Continuous Stochastic Logic

Model checking CSL

Model checking and Time-bounded next

Model checking the steady-state operator

Time-bounded Until

An application

Script: 6.1

Script: 6.2

Assembly line

Test your understanding of CSL (I)

Steady state and next

Test your understanding of CSL (II)

Time bounded until in CSL

Test your understanding of CSL (III)

Other courses offered by Coursera

– / –
3 months
Beginner
– / –
20 hours
Beginner
– / –
2 months
Beginner
– / –
3 months
Beginner
View Other 6726 CoursesRight Arrow Icon
qna

Quantitative Model Checking
 at 
Coursera 

Student Forum

chatAnything you would want to ask experts?
Write here...