The analysis of complex distributed systems requires dedicated software tools. The mCRL
language and toolset have been developed to support such analysis. We highlight changes …

We provide a new algorithm to determine stuttering equivalence with time complexity O (m
log n), where n is the number of states and m is the number of transitions of a Kripke …

We propose a benchmark suite for parity games that includes the benchmarks that have
been used in the literature, and make it available online. We give an overview of the parity …

Abstract Parameterised Boolean Equation Systems (PBESs) can be used to represent many
different kinds of decision problems. Most notably, model checking and equivalence …

I vividly recall the moment, somewhere in February 2009, when Jan Friso Groote walked into
my office. We had discussed my ambition for doing scientific research before, and he offered …

Abstract Parameterised Boolean Equation Systems (PBESs) can be used to represent many
different kinds of decision problems. Most notably, model checking and equivalence …

This article improves the time bound for calculating the weak/branching bisimulation
minimisation quotient on state-labelled discrete-time Markov chains from O (mn) to an …

The aim of this thesis is to investigate how parity game problems may be solved efficiently in
practice. Parity games are a worthwhile research topic because their simultaneous simplicity …

Fixpoint logic, games, and relations of consequence Page 1 Fixpoint logic, games, and
relations of consequence Citation for published version (APA): Gazda, MW (2016). Fixpoint …

My career as a young scientist perhaps started on the day that I attended a meeting between
several researchers, among others Marieke Huisman, from the Universiteit Twente (UT) and …