DidaWiki

Strumenti Utente

Strumenti Sito

Ti trovi qui: DidaWiki » Corso di Laurea Magistrale in Informatica » Models for Programming Paradigms
magistraleinformatica:mpp:start

Differenze

Queste sono le differenze tra la revisione selezionata e la versione attuale della pagina.

Link a questa pagina di confronto

Entrambe le parti precedenti la revisioneRevisione precedente
magistraleinformatica:mpp:start [04/11/2026 alle 14:16 (30 ore fa)] – [Lectures (2nd part)] Roberto Brunimagistraleinformatica:mpp:start [04/11/2026 alle 14:17 (30 ore fa)] (versione attuale) – [Lectures (2nd part)] Roberto Bruni
Linea 135: Linea 135:
 | 28 | Tue | 24/11 | 11:00-13:00 | PS4 | CCS at work:\\ //playing with CCS (using CAAL), modelling and verification of mutual exclusion algorithms with CCS and CAAL//\\ \\ CAAL session (copy the text and paste it in the Edit panel) | [[http://caal.cs.aau.dk/|CAAL]] | | 28 | Tue | 24/11 | 11:00-13:00 | PS4 | CCS at work:\\ //playing with CCS (using CAAL), modelling and verification of mutual exclusion algorithms with CCS and CAAL//\\ \\ CAAL session (copy the text and paste it in the Edit panel) | [[http://caal.cs.aau.dk/|CAAL]] |
 | 29 | Wed | 25/11 | 11:00-13:00 | H | 22a - Temporal logics:\\ //linear temporal logic (LTL), linear structures models, shifting, LTL satisfaction, equivalence of formulas, automata-like models, computational tree logic (CTL* and CTL), infinite trees, infinite paths, branching structure, CTL* satisfaction, equivalence of formulas, CTL formulas, expressiveness comparison//\\ \\ 22b - Mu-calculus:\\ //mu-calculus syntax and semantics// |  | | 29 | Wed | 25/11 | 11:00-13:00 | H | 22a - Temporal logics:\\ //linear temporal logic (LTL), linear structures models, shifting, LTL satisfaction, equivalence of formulas, automata-like models, computational tree logic (CTL* and CTL), infinite trees, infinite paths, branching structure, CTL* satisfaction, equivalence of formulas, CTL formulas, expressiveness comparison//\\ \\ 22b - Mu-calculus:\\ //mu-calculus syntax and semantics// |  |
-| 30 | Fri | 27/11 | 14:00-16:00 | C1 | 22b - Mu-calculus:\\ //positive normal form, least and greatest fixpoints, invariant properties, possibly properties, mu-calculus with labels//\\ \\ KAT:\\ //Calculus of relations// |  | +| 30 | Fri | 27/11 | 14:00-16:00 | C1 | 22b - Mu-calculus:\\ //positive normal form, least and greatest fixpoints, invariant properties, possibly properties, mu-calculus with labels//  |  | 
-| 31 | Tue | 01/12 | 11:00-13:00 | PS4 | KAT:\\ //Kleene Algebras with Tests// |  |+| 31 | Tue | 01/12 | 11:00-13:00 | PS4 | KAT:\\ //Calculus of relations// |  |
 | 32 | Wed | 02/12 | 11:00-13:00 | H | KAT:\\ //Kleene Algebras with Tests// |  | | 32 | Wed | 02/12 | 11:00-13:00 | H | KAT:\\ //Kleene Algebras with Tests// |  |
 | 33 | Fri | 04/12 | 14:00-16:00 | C1 | KAT:\\ //Kleene Algebras with Tests// |  | | 33 | Fri | 04/12 | 14:00-16:00 | C1 | KAT:\\ //Kleene Algebras with Tests// |  |
 | - | Tue | 01/12 | 11:00-13:00 | PS4 | **festivity** |  | | - | Tue | 01/12 | 11:00-13:00 | PS4 | **festivity** |  |
-| 34 | Wed | 09/12 | 11:00-13:00 | H | KAT:\\ //Reasoning about IMP programs// |  |+| 34 | Wed | 09/12 | 11:00-13:00 | H | KAT:\\ //Kleene Algebras with Tests// |  |
 | 35 | Fri | 11/12 | 14:00-16:00 | C1 | KAT:\\ //Reasoning about IMP programs// |  | | 35 | Fri | 11/12 | 14:00-16:00 | C1 | KAT:\\ //Reasoning about IMP programs// |  |
 | 36 | Tue | 15/12 | 11:00-13:00 | PS4 | KAT:\\ //Reasoning about IMP programs// |  | | 36 | Tue | 15/12 | 11:00-13:00 | PS4 | KAT:\\ //Reasoning about IMP programs// |  |
magistraleinformatica/mpp/start.txt · Ultima modifica: da Roberto Bruni
Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki