• Publications
  • Influence
Test Generation Based on Symbolic Specifications
TLDR
An algorithm is presented, which generates and executes tests on-the-fly on a given system using the family of testing relations ioco$_\mathcal{F}$ to the level of Symbolic Transition Systems (STSs).
A Symbolic Framework for Model-Based Testing
TLDR
A framework for the symbolic implementation relation sioco is defined which lifts ioco to Symbolic Transition Systems, which are transition systems with an explicit notion of data and data-dependent control flow.
Parameterised boolean equation systems
An Overview of the mCRL2 Toolset and Its Recent Advances
TLDR
Changes and improvements made to the mCRL toolset in recent years are highlighted, which affect the scope of application, which has been broadened with extended support for data structures like infinite sets and functions.
Model-checking processes with data
Guidelines for a graduate curriculum on embedded software and systems
TLDR
This paper presents the reflections that took place in the European Network of Excellence Artist leading us to propose principles and structured contents for building curricula on embedded software and systems.
Proof Graphs for Parameterised Boolean Equation Systems
TLDR
It is shown that an adapted notion of support sets called proof graphs gives an alternative characterisation of the solution to a PBES, and proved that minimising proof graphs is NP-hard.
Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems
In this paper, we provide a transformation from the branching bisimulation problem for infinite, concurrent, data-intensive systems in linear process format, into solving Parameterized Boolean
Bisimulation Minimisations for Boolean Equation Systems
TLDR
The concepts of strong bisimulations and idempotence-identifying bisimulation for BESs are introduced and it is proved that these can be used for minimising BESS prior to solving these.
...
...