We study a number of restrictions associated with the first-order relational specification
language Alloy. The main shortcomings we address are:---the lack of a complete calculus for …

We introduce a version of the probabilistic mu-calculus (PMC) built on top of a probabilistic
modal logic that allows encoding n-ary inequational conditions on transition probabilities …

Despite its success in producing numerous general results on state-based dynamics, the
theory of coalgebra has struggled to accommodate the Buechi acceptance condition---a …

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 …

This paper presents a reduction from the problem of solving parity games to the satisfiability
problem in propositional logic (SAT). The reduction is done in two stages, first into difference …

Boolean equation systems are ordered sequences of Boolean equations decorated with
least and greatest fixpoint operators. Boolean equation systems provide a useful framework …

This paper presents a reduction from the problem of solving parity games to the satisfiability
problem in propositional logic (SAT). The reduction is done in two stages, first into difference …

This paper applies symbolic planning to solve parity games equivalent to μ-calculus model
checking problems. Compared to explicit algorithms, state sets are compacted during the …

Symbolic model checking, which enables the automatic verification of large systems,
proceeds by calculating expressions that represent state sets. Traditionally, symbolic model …

This paper presents an algorithm for solving Boolean fixed-point equations containing one
level of nesting of minimum and maximum fixed points. The algorithm assumes that the …