Software Architecture and Calculi 2019-20

Perfil de Métodos Formais em Engenharia de Software

Dep. Informática, Universidade do Minho

Funcionamento da UC a partir de 16 Março 2020

A UC seguirá o método de ensino flipped classroom, que se adapta especialmente bem a aulas não presenciais e irá envolver as seguintes acções, entre outras:

Objectives

The course provides a perspective on process algebra (architecture & calculi).

We start with well-established classical and probabilistic process algebras and illustrate their use in software engineering.

Given the rapid emergence of cyber-physical systems, we next give a special focus to timed and cyber-physical process algebras.

Finally, we lean on more uniform notions and techniques in process algebra, with the goal of giving theoretical foundations to the student and the tools necessary for (s)he to smoothly learn/adapt to modeling and reasoning about software composition in different computational paradigms.

This final part of the course will have a more theoretical, research-centred character, briefly presenting current research challenges.

Syllabus

Summaries (2019-20)

  • Feb 6: Introduction to the course dynamics.

    Labelled transition systems. Determinism, non determinism and probabilism. Corresponding notions of morphism. Bisimilarity. [slides]

  • Feb 13: Process algebra. Detailed study of CCS (Milner's Calculus of Communicating Systems): Operational semantics, expansion theorem; silent transitions and observational equivalences. [slides]

  • Feb 20: Process algebra: conclusion of the previous lecture. Exercises.

  • Feb 27: Modal logics for processes. The Hennessy-Milner theorem. [slides]

    Classification of transition systems. The probabilistic case. Variants. [slides]

  • Mar 5: Process modelling and verification in mCRL2 [slides 1] [slides 2].

    Discussion of examples [code].

  • Mar 12: CANCELLED: Covid-19 preventive determination

  • Mar 19: Timed Automata: syntax, semantics, and notions of equivalence. Examples and exercises [slides].

  • Mar 26: Hands-on UPPAAL [slides].

  • Apr 2: Hybrid Automata: syntax, semantics, and notions of equivalence. Examples and exercises [slides].

  • Apr 16: (tba)

  • Apr 23: (tba)

  • Apr 30: (tba)

  • Mai 7: (tba)

  • May 21: (tba)

  • May 28: (tba)

  • Support

    Notes
    Exercises
    Links

    Bibliography

    Pragmatics

    Assessment
    Lecturers

    Contact