| Entrambe le parti precedenti la revisioneRevisione precedenteProssima revisione | Revisione precedente |
| magistraleinformatica:mpp:start [24/11/2025 alle 10:22 (10 mesi fa)] – [Lectures (2nd part)] Roberto Bruni | magistraleinformatica:mpp:start [10/09/2026 alle 08:39 (13 ore fa)] (versione attuale) – [Models for Programming Paradigms] Roberto Bruni |
|---|
| ====== Models for Programming Paradigms ====== | ====== Models for Programming Paradigms ====== |
| |
| {{:magistraleinformatica:mpp:logo-van-gogh-like.png?150 | }} | {{:magistraleinformatica:mpp:immagine_codex_10_set_2026_10_36_38.png?150 | }} |
| |
| **MPP 2025/26 (0077A, 9 CFU)** | **MPP 2026/27 (0077A, 9 CFU)** |
| |
| Lecturer: **Roberto Bruni** [[http://www.di.unipi.it/~bruni|web]], **Filippo Bonchi** | Lecturer: **Roberto Bruni** [[http://www.di.unipi.it/~bruni|web]], **Filippo Bonchi** |
| |
| Other resources: [[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]] | Other resources: [[https://teams.microsoft.com/l/team/19%3ABpe_eByANoLx1vYSZWTBzJSV46kmdHBedFrr45rCZDQ1%40thread.tacv2/conversations?groupId=3c5b59fa-89df-4591-8f00-257c0527606b&tenantId=c7456b31-a220-47f5-be52-473828670aa1|Microsoft Teams]] |
| |
| Office hours: **Thursday 15:00-18:00** | Office hours: **Thursday 14:00-16:00** |
| |
| ---- | ---- |
| |
| ==== Announcements ==== | ==== Announcements ==== |
| | |
| * 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%3ABpe_eByANoLx1vYSZWTBzJSV46kmdHBedFrr45rCZDQ1%40thread.tacv2/conversations?groupId=3c5b59fa-89df-4591-8f00-257c0527606b&tenantId=c7456b31-a220-47f5-be52-473828670aa1|Microsoft Teams channel]] of the course and then fill the form [[https://forms.cloud.microsoft/e/QAYWB1UJ99|Students information]] to provide the following contact data and info about her/his background: |
| - **first name** | - **first name** |
| - **last name** | - **last name** |
| - **bachelor degree** (course of study and university) | - **bachelor degree** (course of study and university) |
| - **MSc course** (if Computer Science, specify which curriculum) | - **MSc course** (if Computer Science, specify which curriculum) |
| * then, fill the (optional) form about your familiarity with some of the subjects of the course: [[https://forms.office.com/e/HrcJK4etV0|Familiar subjects]] | * then, fill the (optional) form about your familiarity with some of the subjects of the course: [[https://forms.cloud.microsoft/e/iKiS5G4MSh|Familiar subjects]] |
| |
| ---- | ---- |
| |
| |
| [[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]]: Additional material is available on Teams. | [[https://teams.microsoft.com/l/team/19%3ABpe_eByANoLx1vYSZWTBzJSV46kmdHBedFrr45rCZDQ1%40thread.tacv2/conversations?groupId=3c5b59fa-89df-4591-8f00-257c0527606b&tenantId=c7456b31-a220-47f5-be52-473828670aa1|Microsoft Teams]]: Additional material is available on Teams. |
| |
| ^ N ^ Date ^^ Time ^ Room ^ Lecture notes ^ Links ^ | ^ N ^ Date ^^ Time ^ Room ^ Lecture notes ^ Links ^ |
| | 1 | Tue | 16/09 | 16:00-18:00 | C1 | {{ :magistraleinformatica:mpp:2025-09-16_-_01_-_intro.pdf |01 - Introduction to the course}} | | | | 1 | Tue | 15/09 | 11:00-13:00 | PS4 | 01 - Introduction to the course | | |
| | 2 | Thu | 18/09 | 09:00-11:00 | L1 | {{ :magistraleinformatica:mpp:2025-09-18_-_02_-_semantics.pdf |02 - Preliminaries}}:\\ //from syntax to semantics, the role of formal semantics, SOS approach, small-step operational semantics, big-step operational semantics, denotational semantics, compositionality principle, normalisation, determinacy, consistency, equivalence, congruence// | | | | 2 | Wed | 16/09 | 11:00-13:00 | H | 02 - Preliminaries:\\ //from syntax to semantics, the role of formal semantics, SOS approach, small-step operational semantics, big-step operational semantics, denotational semantics, compositionality principle, normalisation, determinacy, consistency, equivalence, congruence// | | |
| | 3 | Fri | 19/09 | 16:00-18:00 | L1 | Exercises\\ \\ {{ :magistraleinformatica:mpp:2025-09-19_-_03_-_unification.pdf |03 - Unification}}:\\ //inference process, signatures, substitutions, most general than relation, unification problem, most general unifiers, unification algorithm// | | | | 3 | Fri | 18/09 | 14:00-16:00 | C1 | Exercises\\ \\ 03 - Unification:\\ //inference process, signatures, substitutions, most general than relation, unification problem, most general unifiers, unification algorithm// | | |
| | 4 | Tue | 23/09 | 16:00-18:00 | C1 | Exercises:\\ //unification, goal-oriented derivations//\\ \\ {{ :magistraleinformatica:mpp:2025-09-23_-_04_-_logic.pdf |04 - Logical systems}}:\\ //logical systems, derivations, theorems, logic programs, goal-oriented derivations// | | | | 4 | Tue | 22/09 | 11:00-13:00 | PS4 | Exercises:\\ //unification, goal-oriented derivations//\\ \\ 04 - Logical systems:\\ //logical systems, derivations, theorems, logic programs, goal-oriented derivations// | | |
| | 5 | Thu | 25/09 | 09:00-11:00 | L1 | {{ :magistraleinformatica:mpp:2025-09-25_-_05a_-_induction.pdf |05a - Induction}}:\\ //precedence relation, infinite descending chains, well-founded relations, well-founded induction, mathematical induction, proof of induction principle, structural induction, termination of arithmetic expressions, determinacy of arithmetic expressions, many-sorted signatures, arithmetic and boolean expressions, structural induction over many-sorted signatures, termination of boolean expressions, memories, update operation, operational semantics of commands// | | | | 5 | Wed | 23/09 | 11:00-13:00 | H | 05a - Induction:\\ //precedence relation, infinite descending chains, well-founded relations, well-founded induction, mathematical induction, proof of induction principle, structural induction, termination of arithmetic expressions, determinacy of arithmetic expressions, many-sorted signatures, arithmetic and boolean expressions, structural induction over many-sorted signatures, termination of boolean expressions, memories, update operation, operational semantics of commands// | | |
| | 6 | Fri | 26/09 | 16:00-18:00 | L1 | Exercises:\\ //induction//\\ \\ {{ :magistraleinformatica:mpp:2025-09-26_-_05b_-_more_induction.pdf |05b - More induction (Structural Induction)}}://many-sorted signatures, arithmetic and boolean expressions, structural induction over many-sorted signatures, termination of boolean expressions, memories, update operation, operational semantics of commands// | | | | 6 | Fri | 25/09 | 14:00-16:00 | C1 | Exercises:\\ //induction//\\ \\ 05b - More induction (Structural Induction)://many-sorted signatures, arithmetic and boolean expressions, structural induction over many-sorted signatures, termination of boolean expressions, memories, update operation, operational semantics of commands// | | |
| | 7 | Tue | 30/09 | 16:00-18:00 | C1 | Exercises:\\ //induction//\\ \\ {{ :magistraleinformatica:mpp:2025-09-30_-_05c_-_rule_induction.pdf |05c - More induction (Rule Induction)}}:\\ //divergence, rule for divergence, limits of structural induction, induction on derivations, rule induction, determinacy of commands// | | | | 7 | Tue | 29/09 | 11:00-13:00 | PS4 | Exercises:\\ //induction//\\ \\ 05c - More induction (Rule Induction):\\ //divergence, rule for divergence, limits of structural induction, induction on derivations, rule induction, determinacy of commands// | | |
| | 8 | Thu | 02/10 | 09:00-11:00 | L1 | {{ :magistraleinformatica:mpp:2025-10-02_-_06_-_equivalence.pdf |06 - Equivalence}}:\\ //operational equivalence, concrete equivalences, parametric equivalences, equivalence and divergence//\\ \\ Exercises:\\ //termination, determinacy, divergence//\\ \\ {{ :magistraleinformatica:mpp:2025-10-02_-_07_-_recursion.pdf |07 - Induction and recursion}}:\\ //well-founded recursion, lexicographic precedence relation, Ackermann function, denotational semantics of arithmetic expressions, towards denotational semantics of commands// | | | | 8 | Wed | 30/09 | 11:00-13:00 | H | 06 - Equivalence:\\ //operational equivalence, concrete equivalences, parametric equivalences, equivalence and divergence//\\ \\ Exercises:\\ //termination, determinacy, divergence//\\ \\ 07 - Induction and recursion:\\ //well-founded recursion, lexicographic precedence relation, Ackermann function, denotational semantics of arithmetic expressions, towards denotational semantics of commands// | | |
| | - | Fri | 03/10 | 16:00-18:00 | L1 | **Canceled:**\\ //General strike// | | | | 9 | Fri | 02/10 | 14:00-16:00 | C1 | Exercises:\\ //termination, determinacy, divergence//\\ \\ 08a - Partial orders and fixpoints:\\ //consistency of operational and denotational semantics for arithmetic expressions, fixpoint equations, partial orders, Hasse diagrams, chains, least element, minimal element, bottom element, upper bounds, least upper bound, limits, complete partial orders, powerset completeness, prefix independence, CPO of partial functions// | | |
| | 9 | Tue | 07/10 | 16:00-18:00 | C1 | Exercises:\\ //termination, determinacy, divergence//\\ \\ {{ :magistraleinformatica:mpp:2025-10-07_-_08a_-_cpo.pdf |08a - Partial orders and fixpoints}}:\\ //consistency of operational and denotational semantics for arithmetic expressions, fixpoint equations, partial orders, Hasse diagrams, chains, least element, minimal element, bottom element, upper bounds, least upper bound, limits, complete partial orders, powerset completeness, prefix independence, CPO of partial functions// | | | | 10 | Tue | 06/10 | 11:00-13:00 | PS4 | 08b - Partial orders and fixpoints (Kleene's theorem):\\ //monotonicity, continuity, Kleene's fixpoint theorem//\\ \\ Exercises:\\ //well-founded recursion, posets, semantics// | | |
| | - | Thu | 09/10 | 09:00-11:00 | L1 | **Canceled:**\\ //Orientation acitivities// | | | | 11 | Wed | 07/10 | 11:00-13:00 | H | 08c - Partial orders and fixpoints (Immediate Consequence Operator):\\ //McCarthy's 91 function, recursive definitions of partial functions as logical systems, immediate consequences operator, set of theorems as fixpoint//\\ \\ 09 - Denotational semantics:\\ //lambda-notation, free variables, capture-avoiding substitutions, alpha-conversion, beta rule, conditionals, denotational semantics of commands, fixpoint computation// | | |
| | - | Fri | 10/10 | 16:00-18:00 | L1 | **Canceled:**\\ //Orientation acitivities// | | | | 12 | Fri | 09/10 | 14:00-16:00 | C1 | 10 - Consistency:\\ //denotational equivalence, congruence, compositionality principle, consistency of commands, correctness, completeness// | | |
| | 10 | Tue | 14/10 | 16:00-18:00 | C1 | **Prof. Bonchi**\\ {{ :magistraleinformatica:mpp:2025-10-14_-_08b_-_kleene.pdf |08b - Partial orders and fixpoints (Kleene's theorem)}}:\\ //monotonicity, continuity, Kleene's fixpoint theorem//\\ \\ Exercises:\\ //well-founded recursion, posets, semantics// | | | | 13 | Tue | 13/10 | 11:00-13:00 | PS4 | Exercises:\\ //CPO, continuous functions, IMP// | | |
| | 11 | Thu | 16/10 | 09:00-11:00 | L1 | **Prof. Bonchi**\\ {{ :magistraleinformatica:mpp:2025-10-14_-_08c_-_ico.pdf |08c - Partial orders and fixpoints (Immediate Consequence Operator)}}:\\ //McCarthy's 91 function, recursive definitions of partial functions as logical systems, immediate consequences operator, set of theorems as fixpoint//\\ \\ {{ :magistraleinformatica:mpp:2025-10-16_-_09_-_denotational_imp.pdf |09 - Denotational semantics}}:\\ //lambda-notation, free variables, capture-avoiding substitutions, alpha-conversion, beta rule, conditionals, denotational semantics of commands, fixpoint computation// | | | | 14 | Wed | 14/10 | 11:00-13:00 | H | 11a - Haskell:\\ //an overview, Haskell ghci, basics, tuples, lists, list comprehension, guards, pattern matching, lambda, partial application, zip// | [[https://www.haskell.org/|Haskell]] | |
| | 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// | | | | 15 | Fri | 16/10 | 14:00-16:00 | C1 | 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]] | |
| | 13 | Tue | 21/10 | 16:00-18:00 | C1 | Exercises:\\ //CPO, continuous functions, IMP// | | | | 16 | Tue | 20/10 | 11:00-13:00 | PS4 | 12a - HOFL:\\ //syntax, pre-terms, types, types judgements, type system, type checking, type inference, principal type, type preservation//\\ \\ Exercises:\\ //Haskell, type inference in HOFL// | | |
| | 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// | | | | 17 | Wed | 21/10 | 11:00-13:00 | H | 12b - HOFL:\\ //canonical forms, operational semantics, lazy vs eager evaluation//\\ \\ Exercises:\\ //HOFL, typing, operational semantics// | | |
| | 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// | | | | 18 | Fri | 23/10 | 14:00-16:00 | C1 | 13a - Domain theory:\\ //Integers with bottom, cartesian product, projections, switching lemma, functional domains, lifting, let notation//\\ \\ Exercises:\\ //domains, HOFL denotational semantics// | | |
| | 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// | | | | 19 | Tue | 27/10 | 11:00-13:00 | PS4 | 13b - Lifted Domains:\\ //lifted domains, lifting operator, de-lifting//\\ \\ 14 - Denotational semantics of HOFL:\\ //definition and examples, type consistency, continuity theorems, apply, fix, curry, uncurry, substitution lemma, compositionality, only free variables matters, canonical terms are not bottom//\\ \\ Exercises:\\ //HOFL, typing, denotational semantics, domains// | | |
| | 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// | | | | 20 | Wed | 28/10 | 11:00-13:00 | H | 14 - Denotational semantics of HOFL (ctd.):\\ //continuity theorems, fix, curry, uncurry, substitution lemma, compositionality, only free variables matters, canonical terms are not bottom//\\ \\ 15 - Consistency of HOFL:\\ //Counterexample to completeness, correctness of the operational semantics, operational convergence, denotational convergence, operational convergence implies denotational convergence (and vice versa), operational and denotational equivalence, correspondence for type int, unlifted semantics, lifted vs unlifted semantics// | | |
| | 18 | Fri | 31/10 | 16:00-18:00 | L1 | {{ :magistraleinformatica:mpp:2025-10-31_-_13a_-_domains.pdf |13a - Domain theory}}:\\ //Integers with bottom, cartesian product, projections, switching lemma, functional domains, lifting, let notation//\\ \\ Exercises:\\ //domains, HOFL denotational semantics// | | | |
| | 19 | Tue | 04/11 | 16:00-18:00 | C1 | {{ :magistraleinformatica:mpp:2025-11-04_-_13b_-_lifted_domains.pdf |13b - Lifted Domains}}:\\ //lifted domains, lifting operator, de-lifting//\\ \\ {{ :magistraleinformatica:mpp:2025-11-04_-_14_-_hofl_denotational.pdf |14 - Denotational semantics of HOFL}}:\\ //definition and examples, type consistency, continuity theorems, apply, fix, curry, uncurry, substitution lemma, compositionality, only free variables matters, canonical terms are not bottom//\\ \\ Exercises:\\ //HOFL, typing, denotational semantics, domains// | | | |
| | 20 | Thu | 06/11 | 09:11-18:00 | C1 | {{ :magistraleinformatica:mpp:2025-11-04_-_14_-_hofl_denotational.pdf |14 - Denotational semantics of HOFL (ctd.)}}:\\ //continuity theorems, fix, curry, uncurry, substitution lemma, compositionality, only free variables matters, canonical terms are not bottom//\\ \\ {{ :magistraleinformatica:mpp:2025-11-06_-_15_-_consistency_hofl.pdf |15 - Consistency of HOFL}}:\\ //Counterexample to completeness, correctness of the operational semantics, operational convergence, denotational convergence, operational convergence implies denotational convergence (and vice versa), operational and denotational equivalence, correspondence for type int, unlifted semantics, lifted vs unlifted semantics// | | | |
| |
| ---- | ---- |
| |
| |
| [[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]]: Additional material is available on Teams. | [[https://teams.microsoft.com/l/team/19%3ABpe_eByANoLx1vYSZWTBzJSV46kmdHBedFrr45rCZDQ1%40thread.tacv2/conversations?groupId=3c5b59fa-89df-4591-8f00-257c0527606b&tenantId=c7456b31-a220-47f5-be52-473828670aa1|Microsoft Teams]]: Additional material is available on Teams. |
| |
| ^ 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 | 30/10 | 14:00-16:00 | C1 | 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// | [[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 | | | | | 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 | | | | | 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 | | | | | 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 | | | | | 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 | | | | | 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// | | |
| | 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 | | | | | 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// | | |
| | 28 | Tue | 25/11 | **14:00-16:00** | **D1** | 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// | | | | 28 | | | | | 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 | Thu | 27/11 | 09:00-11:00 | L1 | 22b - Mu-calculus:\\ //mu-calculus, positive normal form, least and greatest fixpoints, invariant properties, possibly properties, mu-calculus with labels//\\ \\ 23 - Pi-calculus:\\ //name mobility, free names, bound names, syntax and operational semantics, scope extrusion, early and late bisimilarities, weak semantics// | | | | 29 | | | | | 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 | 28/11 | 16:00-18:00 | L1 | 24a - Discrete Time 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//\\ \\ 24b - Continuous Time Markov Chains:\\ //negative exponential distribution, CTMC, embedded DTMC, infinitesimal generator matrix, CTMC stationary distribution// | | | | 30 | | | | | 22b - Mu-calculus:\\ //positive normal form, least and greatest fixpoints, invariant properties, possibly properties, mu-calculus with labels//\\ \\ KAT:\\ //Calculus of relations// | | |
| | 31 | Tue | 02/12 | 16:00-18:00 | C1 | 25 - Probabilistic bisimilarities:\\ //bisimilarity revisited, reachability predicate, CTMC bisimilarity, DTMC bisimilarity, Markov chains with actions, probabilistic reactive systems, bisimilarity for reactive systems, Larsen-Skou logic//\\ \\ 26 - PEPA:\\ //motivation, basic ideas, PEPA workflow, PEPA syntax, cooperation combinator, bounded capacity, apparent rate, PEPA operational semantics, performance analysis, reward structures// | | | | 31 | | | | | KAT:\\ //Kleene Algebras with Tests// | | |
| | 32 | Thu | 04/12 | 09:00-11:00 | L1 | **Prof. Bonchi**\\ KAT | | | | 32 | | | | | KAT:\\ //Kleene Algebras with Tests// | | |
| | 33 | Fri | 05/12 | 16:00-18:00 | L1 | **Prof. Bonchi**\\ KAT | | | | 33 | | | | | KAT:\\ //Reasoning about IMP programs// | | |
| | 34 | Tue | 09/12 | 16:00-18:00 | C1 | **Prof. Bonchi**\\ KAT | | | | 34 | | | | | KAT:\\ //Reasoning about IMP programs// | | |
| | 35 | Thu | 11/12 | 09:00-11:00 | L1 | **Prof. Bonchi**\\ KAT | | | |
| | 36 | Fri | 12/12 | 16:00-18:00 | L1 | Exercises:\\ //Samples from exam exercises// | | | |
| | End | | | | | | | | | End | | | | | | | |
| |
| ==== Past courses ==== | ==== Past courses ==== |
| |
| | * [[magistraleinformatica:mpp:2025-26|MPP (A.A. 2025/26)]] |
| * [[magistraleinformatica:psc:|PSC (A.A. 2024/25)]] | * [[magistraleinformatica:psc:|PSC (A.A. 2024/25)]] |
| * [[magistraleinformatica:psc:2023-24:|PSC (A.A. 2023/24)]] | * [[magistraleinformatica:psc:2023-24:|PSC (A.A. 2023/24)]] |
