About FSA

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…


Proceedings TACAS 2021 are online

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.

Posted in Research | Comments Off on Proceedings TACAS 2021 are online

Two Assistant Professor and/or Support Positions in FSA

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

Posted in People, Research | Comments Off on Two Assistant Professor and/or Support Positions in FSA

Paper on the axiomatisability of parallel composition accepted for presentation at CSL 2021

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

Posted in Research | Comments Off on Paper on the axiomatisability of parallel composition accepted for presentation at CSL 2021

Big software project MERITS finished

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

Posted in Projects | Comments Off on Big software project MERITS finished

Paper accepted at Concur2020

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

Posted in Research | Tagged , | Comments Off on Paper accepted at Concur2020

More news…