Parisian Master of Research in Computer Science
Master Parisien de Recherche en Informatique (MPRI)

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

cours:c-2-8-1 [2019/11/06 09:18]
gastin [Outline of the course]
cours:c-2-8-1 [2019/11/14 08:22] (current)
bollig [Outline of the course]
Line 13: Line 13:
 The lectures will take place on Wednesday, **10:15 - 11:45**, in Bat. Sophie Germain, room 1013. The lectures will take place on Wednesday, **10:15 - 11:45**, in Bat. Sophie Germain, room 1013.
  
-**The first lecture is on Wednesday, 18th September 2019.** +**The first exam (partiel) takes place on Wednesday, 20th November 2019, 10:15 - 11:45, in Bat. Sophie Germain, room 1013.**
 ==== Description ==== ==== Description ====
  
Line 26: Line 25:
 | **Lecture** || **Date** || **Contents** ||  | **Lecture** || **Date** || **Contents** || 
 | **1st** || 18/09/2019 || Introduction and motivating examples. ||  | **1st** || 18/09/2019 || Introduction and motivating examples. || 
-| **2nd** || 25/09/2019 || automata models of concurrent processes with data structures; operational semantics; graph semantics ||+| **2nd** || 25/09/2019 || Automata models of concurrent processes with data structures; operational semantics; graph semantics ||
 | **3rd** || 02/10/2019 || MSO logic; expressive power of MSO logic || | **3rd** || 02/10/2019 || MSO logic; expressive power of MSO logic ||
-| **4th** || 09/10/2019 || expressive power of MSO logic; underapproximate verification || +| **4th** || 09/10/2019 || Expressive power of MSO logic; underapproximate verification || 
-| **5th** || 16/10/2019 || underapproximate verification; co-graphs and tree interpretation; special tree-width || +| **5th** || 16/10/2019 || Underapproximate verification; co-graphs and tree interpretation; special tree-width || 
-| **6th** || 23/10/2019 || special tree-width, decomposition game, examples ||+| **6th** || 23/10/2019 || Special tree-width, decomposition game, examples ||
 | **7th** || 06/11/2019 || Special tree-width and tree interpretation; decision procedures via MSO; decision procedures via tree automata || | **7th** || 06/11/2019 || Special tree-width and tree interpretation; decision procedures via MSO; decision procedures via tree automata ||
- ||  || propositional dynamic logic (PDL)|| +**9th** || 13/11/2019 || Exercises || 
-|  ||  || model-checking of existentially bounded behaviors; synthesis from PDL formulas into CPDS || +|  || 20/11/2019 || First exam || 
-|  ||  || asynchronous automata || +| **10th** || 04/12/2019 || Propositional dynamic logic (PDL) || 
-|  ||  || revision and exercises ||+|  ||  || Synthesis of CPDS from PDL formulas || 
 +|  ||  || Asynchronous automata || 
 +|  ||  || Exercises || 
 +|  ||  || Second exam ||
 ==== Lecture Notes ==== ==== Lecture Notes ====
  
 
Universités partenaires Université Paris-Diderot
Université Paris-Saclay
ENS Cachan École polytechnique Télécom ParisTech
ENS
Établissements associés Université Pierre-et-Marie-Curie CNRS INRIA CEA