The journal paper “Adaptive Non-Linear Pattern Matching Automata” by Rick Erkens and Maurice Laveaux has been accepted for publication in the FSCD2020 special issue of Logical Methods in Computer Science.
On Friday July 2, 2021, our colleague Luca Aceto from Reykjavik University delivered an invited talk at LICS 2021 entitled In search of lost time: Axiomatising parallel composition in process algebras. An article with the …continue reading
In 2020, the article Off-the-shelf Automated Analysis of Liveness Properties for Just Paths by Mark Bouwman, Bas Luttik and Tim Willemse published as Acta Informatica 57:551-590. The article was recently presented at FORTE 2021; you …continue reading
The paper A Formalisation of SysML State Machines in mCRL2 by Mark Bouwman, Bas Luttik and Djurre van der Wal was presented at FORTE 2021, a workshop co-located with DisCoTec 2021. Both the paper and Mark Bouman’s …continue reading
Thomas Neele, who obtained his PhD under the supervision of Tim Willemse and Jan Friso Groote, won the award for the best dissertation of 2020 of the Dutch Research School IPA for his dissertation “Reductions …continue reading
The paper Decomposing Monolithic Processes in a Process Algebra with Multi-actions by Maurice Laveaux and Tim Willemse was accepted for presentation at ICE 2021, a workshop co-located with DisCoTec 2021. The interactive style of reviewing …continue reading
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. Screening has started. The application deadline is 30 April, …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
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