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/12/09 18:23]
bollig [Outline of the course]
cours:c-2-8-1 [2020/01/12 17:03] (current)
bollig [Outline of the course]
Line 31: Line 31:
 | **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 ||
-| **9th** || 13/11/2019 || Exercises ||+| **8th** || 13/11/2019 || Exercises ||
 |  || 20/11/2019 || First exam || |  || 20/11/2019 || First exam ||
-| **10th** || 04/12/2019 || Propositional dynamic logic (PDL) || +| **9th** || 04/12/2019 || Propositional dynamic logic (PDL) || 
-| **11th** || 18/12/2019 || Synthesis of CPDS from PDL formulas || +| **10th** || 18/12/2019 || Synthesis of CPDS from PDL formulas (1) || 
- ||  || Asynchronous automata || +**11th** || 08/01/2020 || Synthesis of CPDS from PDL formulas (2) || 
- ||  || Exercises ||+| **12th** || 15/01/2020 || Underapproximate verification for ICPDL || 
 +| || **22/01/2020** || **No lecture** || 
 +| **13th** || 29/01/2020 || Asynchronous automata || 
 +**14th** ||  || Exercises ||
 |  ||  || Second exam || |  ||  || 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