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-9 [2012/01/23 10:55]
sangnier [Part IV : Modelling and verification of programs using Presburger]
cours:c-2-9 [2012/03/24 18:24] (current)
habermehl [Partie III : Counter systems and Presburger arithmetic]
Line 81: Line 81:
 | **2-9**.8 | 20 dec | Pas de cours |  | | | | **2-9**.8 | 20 dec | Pas de cours |  | | |
 | **2-9**.8 | 3 jan | P. Habermehl | Decidability using finite-state automata. | | [[http://www.liafa.jussieu.fr/~haberm/cours/mpri/cours3.pdf|Slides]]| | **2-9**.8 | 3 jan | P. Habermehl | Decidability using finite-state automata. | | [[http://www.liafa.jussieu.fr/~haberm/cours/mpri/cours3.pdf|Slides]]|
-| **2-9**.9 | 10 jan | P. Habermehl | Extension to real numbers using [[http://en.wikipedia.org/wiki/Büchi_automaton|weak Büchi automata]].| | [[http://www.liafa.jussieu.fr/~haberm/cours/mpri/cours4.pdf|last year's slides]]| +| **2-9**.9 | 10 jan | P. Habermehl | Extension to real numbers using [[http://en.wikipedia.org/wiki/Büchi_automaton|weak Büchi automata]].| | [[http://www.liafa.jussieu.fr/~haberm/cours/mpri/cours4.pdf|Slides]]| 
-| **2-9**.10 | 17 jan | P. Habermehl | Presburger definable sets = semilinear sets. Applications. | | [[http://www.liafa.jussieu.fr/~haberm/cours/mpri/cours5.pdf|last year's slides]]|+| **2-9**.10 | 17 jan | P. Habermehl | Presburger definable sets = semilinear sets. Applications. | | [[http://www.liafa.jussieu.fr/~haberm/cours/mpri/cours5.pdf|Slides]]|
  
  
 
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