Research We investigate and develop theories, techniques and tools for modelling and analysing the behaviours of (concurrent) systems. Research focusses on process algebra, semantics, model checking, logics and satisfiability solving. Application areas include protocols, hardware designs, industrial control systems. Tools developed by the group include mCRL2 and MaDL. Read More…
Education We offer courses in Logic, Formal Methods, Model Checking and Automated Reasoning. We are always looking for enthusiastic people who are interested in a research project or thesis in our Master programme. Read More…
The paper Are Two Binary Operators Necessary to Finitely Axiomatise Parallel Composition? by Luca Aceto, Valentina Castiglioni, Wan Fokkink, Anna Ingolfsdottir and Bas Luttik has been accepted for presentation at CSL 2021, which will take …continue reading
The NWO Big Software project MERITS is finished. It investigated whether refactoring of legacy software is possible by automatic learning. The conclusion is that this is a bridge too far, but learning techniques are an …continue reading
A paper containing a near-linear time algorithm for weak bisimilarity for Markov chains, by Jansen, Groote, Timmers and Yang has been accepted at Concur 2020. The paper provides an average time O(m log^4 n) algorithm, …continue reading
The paper “Effective System Level Liveness Verification” by Alexander Fedotov, Jeroen Keiren and Julien Schmaltz has been accepted for presentation at FMCAD 2020, which will take place as an online conference. The paper introduces a …continue reading
The paper “Formal verification of OIL component specifications using mCRL2” by Olav Bunte, Louis van Gool and Tim Willemse has been accepted for presentation at FMICS 2020, which will take place as an online conference, …continue reading
- Colloquium 7 January 12.45 - 13.30, 2021, MS Teams. Wieger Wesselink: Symbolic Reachability using LDDs.
- Colloquium 17 December 12.45 - 13.30, 2020, MS Teams. Herman Geuvers: Relating Apartness and Bisimulation.
- Colloquium 10 December 12.45 - 13.30, 2020, MS Teams. Flip van Spaendonck: “Automatic Sequences: The effect of local changes on complexity”.
- Colloquium 3 December 12.45 - 13.30, 2020, MS Teams. Olav Bunte: Evidence for behavioural inequivalence.
- MSc Defence 27 November 13.00 - 13.45, 2020, MS Teams. Wouter Schols: Verification of an iterative implementation of Tarjan’s algorithm for Strongly Connected Components using Dafny.
- Colloquium 26 November 12.45 - 13.30, 2020, MS Teams. Anton Wijs: “Lock and Fence When Needed: State Space Exploration + Static Analysis = Improved Fence and Lock Insertion”.
- Colloquium 19 November 12.45 - 13.30, 2020, MS Teams. Tim Willemse: On Recursive Algorithms for Solving Parity Games.
- Colloquium 12 November 12.45 - 13.30, 2020, MS Teams. Rick Erkens: “Bloom’s Cool Congruence Formats for Weak Behavioral Equivalences: Make Branching Bisimilarity a Congruence Again”.