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 proceedings of TACAS 2021 are online (LNCS 12651 and LNCS 12652). Editors are J.F. Groote and K.G. Larsen. They are open access.
The Formal System Analysis group has two vacancies for tenured/tenure track assistant professor and/or support staff positions. More information about these positions can be found here. The application deadline is 15 April, 2021; screening will …continue reading
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
- Colloquium 8 April 12.45 - 13.30, 2021, MS Teams. Rick Erkens: A Set Automaton to Locate All Pattern Matches in a Term.
- Colloquium 1 April 12.45 - 13.30, 2021, MS Teams. Bas Luttik: Equationally axiomatising parallel composition.
- Colloquium 25 March 12.45 - 13.30, 2021, MS Teams. Jan Friso Groote: Partition refinement algorithms for strong bisimulation are Omega(n log n).
- Colloquium 18 March 12.45 - 13.30, 2021, MS Teams. Hans Zantema: Complexity of Simon’s problem in classical sense.
- Colloquium 11 March 12.45 - 13.30, 2021, MS Teams. Jan Martens: Solving bisimilarity and the relational coarsest partition problem in sub-linear parallel time seems hard.
- Colloquium 4 March 12.45 - 13.30, 2021, MS Teams. Erik de Vink: On Quantum Process Algebra.
- Colloquium 25 February 12.45 - 13.30, 2021, MS Teams. Maurice Laveaux: Antichain Based Algorithm for Fair Testing.
- Colloquium 11 February 12.45 - 13.30, 2021, MS Teams. Ferry Timmers: State-space exploration of generated system controllers.