| Entrambe le parti precedenti la revisioneRevisione precedenteProssima revisione | Revisione precedente |
| magistraleinformatica:mpp:start [19/11/2025 alle 10:22 (12 giorni fa)] – [Lectures (2nd part)] Roberto Bruni | magistraleinformatica:mpp:start [01/12/2025 alle 13:42 (3 ore fa)] (versione attuale) – [Lectures (2nd part)] Roberto Bruni |
|---|
| |
| ==== Announcements ==== | ==== Announcements ==== |
| | |
| | * The lecture of **Friday 28/11** has been **canceled** due to conflicting institutional activities of the instructor. |
| | |
| | * The lecture of **Tuesday 25/11** has been **moved** from 16:00-18:00 to **14:00-16:00 in room D1**. |
| | |
| | * The lectures of **Thursday 09/10 and Friday (10/10)** have been **canceled** due to orientation activities. |
| | |
| | * The lecture of **Friday 03/10** has been **canceled** due to general strike. |
| * As the course starts:\\ Each student must subscribe the [[https://teams.microsoft.com/l/team/19%3AC66XUZJECgys8E7GSFEGLCYhBGIBtw3nGAEb5ndsvuI1%40thread.tacv2/conversations?groupId=083da95a-18f3-4d3e-bd49-d3c1c9e0db3d&tenantId=c7456b31-a220-47f5-be52-473828670aa1|Microsoft Teams channel]] of the course and then fill the form [[https://forms.office.com/e/t0vmX0yf7B|Students information]] to provide the following contact data and info about her/his background: | * As the course starts:\\ Each student must subscribe the [[https://teams.microsoft.com/l/team/19%3AC66XUZJECgys8E7GSFEGLCYhBGIBtw3nGAEb5ndsvuI1%40thread.tacv2/conversations?groupId=083da95a-18f3-4d3e-bd49-d3c1c9e0db3d&tenantId=c7456b31-a220-47f5-be52-473828670aa1|Microsoft Teams channel]] of the course and then fill the form [[https://forms.office.com/e/t0vmX0yf7B|Students information]] to provide the following contact data and info about her/his background: |
| - **first name** | - **first name** |
| | 12 | Fri | 17/10 | 16:00-18:00 | L1 | **Prof. Bonchi**\\ {{ :magistraleinformatica:mpp:2025-10-16_-_10_-_consistency_imp.pdf |10 - Consistency}}:\\ //denotational equivalence, congruence, compositionality principle, consistency of commands, correctness, completeness// | | | | 12 | Fri | 17/10 | 16:00-18:00 | L1 | **Prof. Bonchi**\\ {{ :magistraleinformatica:mpp:2025-10-16_-_10_-_consistency_imp.pdf |10 - Consistency}}:\\ //denotational equivalence, congruence, compositionality principle, consistency of commands, correctness, completeness// | | |
| | 13 | Tue | 21/10 | 16:00-18:00 | C1 | Exercises:\\ //CPO, continuous functions, IMP// | | | | 13 | Tue | 21/10 | 16:00-18:00 | C1 | Exercises:\\ //CPO, continuous functions, IMP// | | |
| | 14 | Thu | 23/10 | 09:00-11:00 | L1 | {{ :magistraleinformatica:mpp:2025-10-23_-_11a_-_haskell.pdf |11a - Haskell}}:\\ //an overview, Haskell ghci, basics, tuples, lists, list comprehension, guards, pattern matching, lambda, partial application, zip// | | | | 14 | Thu | 23/10 | 09:00-11:00 | L1 | {{ :magistraleinformatica:mpp:2025-10-23_-_11a_-_haskell.pdf |11a - Haskell}}:\\ //an overview, Haskell ghci, basics, tuples, lists, list comprehension, guards, pattern matching, lambda, partial application, zip// | [[https://www.haskell.org/|Haskell]] | |
| | 15 | Fri | 24/10 | 16:00-18:00 | L1 | {{ :magistraleinformatica:mpp:2025-10-24_-_11b_-_haskell.pdf |11b - Haskell GHCi}}:\\ //conditionals, cases, pattern matching, exercises, recursive definitions, let-in, where, map, filter, fixpoint operator, folds, application, function composition// | | | | 15 | Fri | 24/10 | 16:00-18:00 | L1 | {{ :magistraleinformatica:mpp:2025-10-24_-_11b_-_haskell.pdf |11b - Haskell GHCi}}:\\ //conditionals, cases, pattern matching, exercises, recursive definitions, let-in, where, map, filter, fixpoint operator, folds, application, function composition// | [[https://www.haskell.org/|Haskell]] | |
| | 16 | Tue | 28/10 | 16:00-18:00 | C1 | {{ :magistraleinformatica:mpp:2025-10-28_-_12a_-_hofl_types.pdf |12a - HOFL}}:\\ //syntax, pre-terms, types, types judgements, type system, type checking, type inference, principal type, type preservation//\\ \\ Exercises:\\ //Haskell, type inference in HOFL// | | | | 16 | Tue | 28/10 | 16:00-18:00 | C1 | {{ :magistraleinformatica:mpp:2025-10-28_-_12a_-_hofl_types.pdf |12a - HOFL}}:\\ //syntax, pre-terms, types, types judgements, type system, type checking, type inference, principal type, type preservation//\\ \\ Exercises:\\ //Haskell, type inference in HOFL// | | |
| | 17 | Thu | 30/10 | 09:00-11:00 | L1 | {{ :magistraleinformatica:mpp:2025-10-30_-_12b_-_hofl_operational.pdf |12b - HOFL}}:\\ //canonical forms, operational semantics, lazy vs eager evaluation//\\ \\ Exercises:\\ //HOFL, typing, operational semantics// | | | | 17 | Thu | 30/10 | 09:00-11:00 | L1 | {{ :magistraleinformatica:mpp:2025-10-30_-_12b_-_hofl_operational.pdf |12b - HOFL}}:\\ //canonical forms, operational semantics, lazy vs eager evaluation//\\ \\ Exercises:\\ //HOFL, typing, operational semantics// | | |
| |
| ^ N ^ Date ^^ Time ^ Room ^ Lecture notes ^ Links ^ | ^ N ^ Date ^^ Time ^ Room ^ Lecture notes ^ Links ^ |
| | 21 | Fri | 07/11 | 16:00-18:00 | L1 | {{ :magistraleinformatica:mpp:2025-11-06_-_15_-_consistency_hofl.pdf |15 - Consistency of HOFL (ctd.)}}:\\ //unlifted semantics, lifted vs unlifted semantics//\\ \\ Exercises:\\ //HOFL//\\ \\ 16a - Erlang:\\ //an overview, erl, numbers, atoms, tuples, lists, terms, variables, term comparison, pattern matching, list comprehension, modules, functions, guards, higher order, recursion, pids, spawn, self, send, receive, examples// | | | | 21 | Fri | 07/11 | 16:00-18:00 | L1 | {{ :magistraleinformatica:mpp:2025-11-06_-_15_-_consistency_hofl.pdf |15 - Consistency of HOFL (ctd.)}}:\\ //unlifted semantics, lifted vs unlifted semantics//\\ \\ Exercises:\\ //HOFL//\\ \\ {{ :magistraleinformatica:mpp:2025-11-07_-_16a_-_erlang.pdf |16a - Erlang}}:\\ //an overview, erl, numbers, atoms, tuples, lists, terms, variables, term comparison, pattern matching, list comprehension, modules, functions, guards, higher order, recursion, pids, spawn, self, send, receive, examples// | [[http://www.erlang.org/|Erlang]] | |
| | 22 | Tue | 11/11 | 14:00-16:00 | C1 | {{ :magistraleinformatica:mpp:2025-11-11_-_16b_-_google_go.pdf |16b - GoogleGo}}:\\ //an overview, playground, Go principles, variable declaration, type conversion, multiple assignments, type inference, imports, packages and public names, named return values, naked return, multiple results, conditionals and loops, pointers, struct, receiver arguments and methods, interfaces, goroutines, bidirectional channels, channel types, send, receive, asynchronous communication with buffering, close, select, communicating communication means, range, handling multiple senders, concurrent prime sieve// | | | | 22 | Tue | 11/11 | 14:00-16:00 | C1 | {{ :magistraleinformatica:mpp:2025-11-11_-_16b_-_google_go.pdf |16b - GoogleGo}}:\\ //an overview, playground, Go principles, variable declaration, type conversion, multiple assignments, type inference, imports, packages and public names, named return values, naked return, multiple results, conditionals and loops, pointers, struct, receiver arguments and methods, interfaces, goroutines, bidirectional channels, channel types, send, receive, asynchronous communication with buffering, close, select, communicating communication means, range, handling multiple senders, concurrent prime sieve// | [[http://golang.org/|Google Go]] | |
| | 23 | Thu | 13/11 | 09:00-11:00 | L1 | {{ :magistraleinformatica:mpp:2025-11-13_-_17_-_ccs.pdf |17 - CCS}}:\\ //Introduction to concurrency, Syntax, operational semantics, value passing, modelling imperative programs with CCS// | | | | 23 | Thu | 13/11 | 09:00-11:00 | L1 | {{ :magistraleinformatica:mpp:2025-11-13_-_17_-_ccs.pdf |17 - CCS}}:\\ //Introduction to concurrency, Syntax, operational semantics, value passing, modelling imperative programs with CCS// | | |
| | 24 | Fri | 14/11 | 16:00-18:00 | L1 | {{ :magistraleinformatica:mpp:2025-11-14_-_18a_-_towards_bisimulation.pdf |18a - Towards bisimulation}}:\\ //abstract semantics, graph isomorphism, trace equivalence, bisimulation game// | | | | 24 | Fri | 14/11 | 16:00-18:00 | L1 | {{ :magistraleinformatica:mpp:2025-11-14_-_18a_-_towards_bisimulation.pdf |18a - Towards bisimulation}}:\\ //abstract semantics, graph isomorphism, trace equivalence, bisimulation game// | | |
| | 25 | Tue | 18/11 | 16:00-18:00 | C1 | {{ :magistraleinformatica:mpp:2025-11-18_-_18b_-_ccs_bisimulation.pdf |18b - Bisimulation}}:\\ //strong bisimulation, strong bisimilarity, strong bisimilarity is an equivalence, strong bisimilarity is a bisimulation, strong bisimilarity is the coarsest strong bisimulation, finitely branching processes, strong bisimilarity as a fixpoint, Phi operator, Phi is monotone, Phi is continuous (on finitely branching processes), guarded processes// | | | | 25 | Tue | 18/11 | 16:00-18:00 | C1 | {{ :magistraleinformatica:mpp:2025-11-18_-_18b_-_ccs_bisimulation.pdf |18b - Bisimulation}}:\\ //strong bisimulation, strong bisimilarity, strong bisimilarity is an equivalence, strong bisimilarity is a bisimulation, strong bisimilarity is the coarsest strong bisimulation, finitely branching processes, strong bisimilarity as a fixpoint, Phi operator, Phi is monotone, Phi is continuous (on finitely branching processes), guarded processes// | | |
| | 26 | Thu | 20/11 | 09:00-11:00 | L1 | 18c - More on bisimulation:\\ //some properties of guarded processes, Knaster-Tarski's fixpoint theorem, strong bisimilarity is a congruence, some laws for strong bisimilarity//\\ \\ 19 - Hennessy-Milner logic:\\ //modalities, HML syntax, formula satisfaction, converse of a formula, HML equivalence// | | | | 26 | Thu | 20/11 | 09:00-11:00 | L1 | {{ :magistraleinformatica:mpp:2025-11-20_-_18c_-_more_bisimulation.pdf |18c - More on bisimulation}}:\\ //some properties of guarded processes, Knaster-Tarski's fixpoint theorem, strong bisimilarity is a congruence, some laws for strong bisimilarity//\\ \\ {{ :magistraleinformatica:mpp:2025-11-20_-_19_-_hml.pdf |19 - Hennessy-Milner logic}}:\\ //modalities, HML syntax, formula satisfaction, converse of a formula, HML equivalence// | | |
| | 27 | Fri | 21/11 | 16:00-18:00 | L1 | 20 - Weak Semantics:\\ //weak transitions, weak bisimulation, weak bisimilarity, weak bisimilarity is not a congruence, weak observational congruence, Milner's tau-laws//\\ \\ 21 - 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) | | | | 27 | Fri | 21/11 | 16:00-18:00 | L1 | {{ :magistraleinformatica:mpp:2025-11-21_-_20_-_weak.pdf |20 - Weak Semantics}}:\\ //weak transitions, weak bisimulation, weak bisimilarity, weak bisimilarity is not a congruence, weak observational congruence, Milner's tau-laws//\\ \\ {{ :magistraleinformatica:mpp:2025-11-21_-_21_-_ccs_at_work.pdf |21 - CCS at work}}:\\ //playing with CCS (using CAAL), modelling and verification of mutual exclusion algorithms with CCS and CAAL// | | |
| | 28 | | | | | 22 - Temporal and modal logics:\\ //linear temporal logic (LTL), linear structures models, shifting, LTL satisfaction, equivalence of formulas, automata-like models// | | | | 28 | Tue | 25/11 | **14:00-16:00** | **D1** | CCS at work:\\ //playing with CCS (using CAAL), modelling and verification of mutual exclusion algorithms with CCS and CAAL//\\ \\ {{ :magistraleinformatica:mpp:caal-2025-26.zip |CAAL session}} (copy the text and paste it in the Edit panel) | [[http://caal.cs.aau.dk/|CAAL]] | |
| | 29 | | | | | 22 - Temporal and modal logics (ctd.):\\ //computational tree logic (CTL* and CTL), infinite trees, infinite paths, branching structure, CTL* satisfaction, equivalence of formulas, CTL formulas, expressiveness comparison, mu-calculus, positive normal form, least and greatest fixpoints, invariant properties, possibly properties, mu-calculus with labels// | | | | 29 | Thu | 27/11 | 09:00-11:00 | L1 | {{ :magistraleinformatica:mpp:2025-11-27_-_22a_-_ltl_ctl.pdf |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//\\ \\ {{ :magistraleinformatica:mpp:2025-11-27_-_22b_-_mu_calculus.pdf |22b - Mu-calculus}}:\\ //mu-calculus syntax and semantics// | | |
| | 30 | | | | | \\ \\ ?? - Pi-calculus:\\ //name mobility, free names, bound names, syntax and operational semantics, scope extrusion, early and late bisimilarities, weak semantics//\\ \\ 25 - Measure theory and Markov chains:\\ //probability space, random variables, stochastic processes, homogeneous Markov chains, DTMC, DTMC as matrices, DTMC as PTS, next state probability, ergodic DTMC, steady state distribution, finite path probability// | | | | - | Fri | 28/11 | 16:00-18:00 | L1 | **Canceled:**\\ //Conflicting institutional activities of the instructor// | | |
| | 31 | | | | | 25 - Measure theory and Markov chains (ctd):\\ //negative exponential distribution, CTMC, embedded DTMC, infinitesimal generator matrix, CTMC stationary distribution//\\ \\ 26 - Probabilistic bisimilarities:\\ //bisimilarity revisited, reachability predicate, CTMC bisimilarity, DTMC bisimilarity, Markov chains with actions, probabilistic reactive systems, bisimilarity for reactive systems, Larsen-Skou logic// | | | | 30 | Tue | 02/12 | 16:00-18:00 | C1 | **Prof. Bruni**\\ {{ :magistraleinformatica:mpp:2025-11-27_-_22b_-_mu_calculus.pdf |22b - Mu-calculus}}:\\ //positive normal form, least and greatest fixpoints, invariant properties, possibly properties, mu-calculus with labels//\\ \\ **Prof. Bonchi**\\ KAT:\\ //Calculus of relations// | | |
| | 32 | | | | | 27 - PEPA:\\ //motivation, basic ideas, PEPA workflow, PEPA syntax, cooperation combinator, bounded capacity, apparent rate, PEPA operational semantics, performance analysis, reward structures// | | | | 31 | Thu | 04/12 | 09:00-11:00 | L1 | **Prof. Bonchi**\\ KAT:\\ //Kleene Algebras with Tests// | | |
| | 33 | | | | | Exercises:\\ //Markov chains, probabilistic systems, PEPA// | | | | 32 | Fri | 05/12 | 16:00-18:00 | L1 | **Prof. Bonchi**\\ KAT:\\ //Kleene Algebras with Tests// | | |
| | 34 | | | | | KAT | | | | 33 | Tue | 09/12 | 16:00-18:00 | C1 | **Prof. Bonchi**\\ KAT:\\ //Reasoning about IMP programs// | | |
| | 35 | | | | | KAT | | | | 34 | Thu | 11/12 | 09:00-11:00 | L1 | **Prof. Bonchi**\\ KAT:\\ //Reasoning about IMP programs// | | |
| | 36 | | | | | Exercises:\\ //Samples from exam exercises// | | | | 35 | Fri | 12/12 | 16:00-18:00 | L1 | **Prof. Bonchi**\\ KAT:\\ //Reasoning about IMP programs// | | |
| | End | | | | | | | | | End | | | | | | | |
| |
