Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
lat [2011/03/01 20:50] jobstman |
lat [2011/03/01 20:57] jobstman |
||
|---|---|---|---|
| Line 40: | Line 40: | ||
| ===== Ecole Doctorale Grenoble ===== | ===== Ecole Doctorale Grenoble ===== | ||
| + | |||
| + | [[http://edmstii.ujf-grenoble.fr/|Ecole Doctorale Mathématiques, Sciences et Technologies de l'Information, Informatique]] | ||
| **Slides for lectures on game theory** (23/11/2010 and 30/11/2010) | **Slides for lectures on game theory** (23/11/2010 and 30/11/2010) | ||
| Line 52: | Line 54: | ||
| **Outline of the first week** (19/04/2010 - 24/04/2010) : | **Outline of the first week** (19/04/2010 - 24/04/2010) : | ||
| - //Monday.// Introduction, First and Second Order Logics {{:w1_mon.pdf|}} (4h, Radu Iosif) | - //Monday.// Introduction, First and Second Order Logics {{:w1_mon.pdf|}} (4h, Radu Iosif) | ||
| - | - //Tuesday.// Automata on Finite Words. Definitions of Recognizability {{w1_tue.pdf|}} (4h, Radu Iosif) | + | - //Tuesday.// Automata on Finite Words. Definitions of Recognizability {{:w1_tue.pdf|}} (4h, Radu Iosif) |
| - //Wednesday.// Regular, Star Free and Aperiodic Languages {{:w1_wed.pdf|}} (4h, Radu Iosif) | - //Wednesday.// Regular, Star Free and Aperiodic Languages {{:w1_wed.pdf|}} (4h, Radu Iosif) | ||
| - //Thursday.// Automata on Infinite Words {{:w1_thu.pdf|}} (4h, Radu Iosif) | - //Thursday.// Automata on Infinite Words {{:w1_thu.pdf|}} (4h, Radu Iosif) | ||
| Line 59: | Line 61: | ||
| **Outline of the second week** (24/05/2010 - 29/05/2010) : | **Outline of the second week** (24/05/2010 - 29/05/2010) : | ||
| - | - //Monday.// Automata on Finite Trees {{w2_mon.pdf}} (4h, Radu Iosif) | + | - //Monday.// Automata on Finite Trees {{:w2_mon.pdf|}} (4h, Radu Iosif) |
| - | - //Tuesday.// Automata on Infinite Trees {{w2_tue.pdf}} (4h, Radu Iosif) | + | - //Tuesday.// Automata on Infinite Trees {{:w2_tue.pdf|}} (4h, Radu Iosif) |
| - | - //Wednesday.// Motivation {{:snsb_course:w2_wed_1.pdf|}}, Terminology {{:snsb_course:w2_wed_2.pdf|}}, Reachability and Buchi games {{:snsb_course:w2_wed_3.pdf|}} (4h, Barbara Jobstmann) | + | - //Wednesday.// Motivation {{:w2_wed_1.pdf|}}, Terminology {{:w2_wed_2.pdf|}}, Reachability and Buchi games {{:w2_wed_3.pdf|}} (4h, Barbara Jobstmann) |
| - | - //Thursday.// Obligation and weak-parity games {{:snsb_course:w2_thu_1.pdf|}}, Parity games {{:snsb_course:w2_thu_2.pdf|}} (4h, Barbara Jobstmann) | + | - //Thursday.// Obligation and weak-parity games {{:w2_thu_1.pdf|}}, Parity games {{:w2_thu_2.pdf|}} (4h, Barbara Jobstmann) |
| - | - //Friday.// Games and tree automata {{:snsb_course:w2_fri_1.pdf|}}, Quantitative Verification and Synthesis {{:snsb_course:quantitative-synthesis-p4.pdf|}}, Mean-payoff games {{:snsb_course:w2_fri_3.pdf|}} (4h, Barbara Jobstmann) | + | - //Friday.// Games and tree automata {{:w2_fri_1.pdf|}}, Quantitative Verification and Synthesis {{:quantitative-synthesis-p4.pdf|}}, Mean-payoff games {{:w2_fri_3.pdf|}} (4h, Barbara Jobstmann) |
| - //Saturday.// Integer Arithmetic, Presburger Arithmetic and Semilinear Sets {{presburger-slide.pdf}}. Definability and Recognizability {{recognizable-slide.pdf}} (4h, Radu Iosif) | - //Saturday.// Integer Arithmetic, Presburger Arithmetic and Semilinear Sets {{presburger-slide.pdf}}. Definability and Recognizability {{recognizable-slide.pdf}} (4h, Radu Iosif) | ||