PhD in Computer Science

PhD Course on “Logic, Automata and Games at the edge of Decidability”

Period
6 - 16 febbraio 2017

Series to which this belongs

30° ciclo
31° Ciclo
32° Ciclo

Description

Course Topics
 
1 Monadic Second Order Logic
1.1 Preliminaries
1.2 Decidability of Decidability of MSO[+1;<]: Büchi’s proof revisited
1.3 The MSO[+1;<] synthesis problem
2 Vector Addition Systems
2.1 Preliminaries
2.2 Decidability of the Reachability problem
2.3 Logical characterizations
2.4 Undecidable Properties
2.5 Decidable extensions and Open problems
3 Lossy Counter Machines
3.1 Preliminaries
3.2 Decidability of the Reachability problem via Well Quasi Orders
3.3 Logical characterizations
3.4 Undecidable properties
3.5 Decidable extensions
4 Interval Temporal Logic
4.1 Preliminaries
4.2 (Un)decidability of Halpern and Shoham's propositional modal logic of intervals
4.3 A maximal fragment of HS and its (un)decidability problem
4.4 Open problems
 

Attachments

Documents
  • pdf   Flyer   (pdf, it, 136 KB, 21/06/17)