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 [2018/11/05 17:22]
bollig [Exam]
cours:c-2-8-1 [2019/09/05 00:03] (current)
bollig [Lecture Notes]
Line 11: Line 11:
 ==== Dates ==== ==== Dates ====
  
-The lectures will take place on Wednesday, 13:15-15:45, in Bat. Sophie Germain, room 1004.+The lectures will take place on Wednesday, 08:45-10:15, in Bat. Sophie Germain, room 1013.
  
-The first lecture is on Wednesday, 12th September 2018.+**The first lecture is on Wednesday, 18th September 2019.**
  
-==== Exam ==== 
  
-**The exam takes place on Wednesday, 21st November 2018, 13:15-15:45, in Bat. Sophie Germain, room 1004.** 
- 
-The lecture notes are allowed during the exam. 
 ==== Description ==== ==== Description ====
  
Line 29: Line 25:
  
  
-| **1st Lecture** || 12/09/2018 || motivating examples, automata models of concurrent processes with data structures ||  +| **1st Lecture** || 18/09/2019 || motivating examples, automata models of concurrent processes with data structures ||  
-**2nd Lecture** || 19/09/2018 || operational semantics; graph semantics; MSO logic || + ||  || operational semantics; graph semantics; MSO logic || 
-**3rd Lecture** || 26/09/2018 || expressive power of MSO logic || + ||  || expressive power of MSO logic || 
-**4th Lecture** || 03/10/2018 || underapproximate verification; special tree-width, decomposition game || + ||  || underapproximate verification; special tree-width, decomposition game || 
-**5th Lecture** || 10/10/2018 || special tree-width and tree interpretation; decision procedures via tree automata || + ||  || special tree-width and tree interpretation; decision procedures via tree automata || 
-**6th Lecture** || 17/10/2018 || propositional dynamic logic (PDL)|| + ||  || propositional dynamic logic (PDL)|| 
-**7th Lecture** || 24/10/2018 || model-checking of existentially bounded behaviors; synthesis from PDL formulas into CPDS || + ||  || model-checking of existentially bounded behaviors; synthesis from PDL formulas into CPDS || 
-**8th Lecture** || 31/10/2018 || asynchronous automata || + ||  || asynchronous automata || 
-**9th Lecture** || 07/11/2018 || revision and exercises || + ||  || revision and exercises ||
-| **Exam** ||  || ||+
 ==== Lecture Notes ==== ==== Lecture Notes ====
  
 [[http://www.lsv.ens-cachan.fr/~bollig/MPRI/non-sequential.pdf|Lecture Notes]] [[http://www.lsv.ens-cachan.fr/~bollig/MPRI/non-sequential.pdf|Lecture Notes]]
-(version as of 31st October 2018, up to date until 7th lecture)+(version as of 31st October 2018)
  
 [[http://www.lsv.ens-cachan.fr/~bollig/MPRI/introduction.pdf|Slides of 1st lecture]] [[http://www.lsv.ens-cachan.fr/~bollig/MPRI/introduction.pdf|Slides of 1st lecture]]
 
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