Thomas Neele

Thomas Neele

Auto-generated profile, based on publicly available information

Thomas Neele

Eindhoven University of Technology The Netherlands

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 April 2019
Verified
Book Chapter
Open access
PDF file
OBOlav Bunte
Olav Bunte
Jan Friso GrooteJan Friso Groote
Jan Friso Groote
JKJeroen J. A. Keiren
Jeroen J. A. Keiren
MLMaurice Laveaux
Maurice Laveaux
TNThomas Neele
Thomas Neele
TWTim A. C. Willemse
Tim A. C. Willemse
Reasoning about the correctness of parallel and distributed systems requires automated tools. By now, the mCRL2 toolset and language have been developed over a course of more than fifteen years. In this paper, we report on the progress and advancements over the past six years. Firstly, the mCRL2 language has been extended to support the modelling of probabilistic behaviour. Furthermore, the usability has been improved with the addition of refinement checking, counterexample generation and a user-friendly GUI. Finally, several performance improvements have been made in the treatment of behavioural equivalences. Besides the changes to the toolset itself, we cover recent applications of mCRL2 in software product line engineering and the use of domain specific languages (DSLs).

8 November 2016
Verified
Book Chapter
Closed access
PDF file
AWAnton Wijs
Anton Wijs
TNThomas Neele
Thomas Neele
DBDragan Bošnački
Dragan Bošnački

22 September 2016
Verified
Book Chapter
Closed access
PDF file
TNThomas Neele
Thomas Neele
AWAnton Wijs
Anton Wijs
DBDragan Bošnački
Dragan Bošnački
JPJaco van de Pol
Jaco van de Pol

20 April 2023
Verified
Book Chapter
Open access
PDF file
TNThomas Neele
Thomas Neele
MSMatteo Sammartino
Matteo Sammartino
Automata learning is a technique to infer an automaton model of a black-box system via queries to the system. In recent years it has found widespread use both in industry and academia, as it enables formal verification when no model is available or it is too complex to create one manually. In this paper we consider the problem of learning the individual components of a black-box synchronous system, assuming we can only query the whole system. We introduce a compositional learning approach in which several learners cooperate, each aiming to learn one of the components. Our experiments show that, in many cases, our approach requires significantly fewer queries than a widely-used non-compositional algorithm such as $$\mathtt {L^*}$$ L ∗ .

17 October 2015
Verified
Book Chapter
Closed access
PDF file
TDTom Van Dijk
Tom Van Dijk
EHErnst Moritz Hahn
Ernst Moritz Hahn
DJDavid N. Jansen
David N. Jansen
YLYong Li
Yong Li
TNThomas Neele
Thomas Neele
LZLijun Zhang
Lijun Zhang

2 October 2022 in International Journal on Software Tools for Technology Transfer
Verified
Journal Article
Open access
PDF file
TNThomas Neele
Thomas Neele
TWTim A. C. Willemse
Tim A. C. Willemse
WWWieger Wesselink
Wieger Wesselink
AVAntti Valmari
Antti Valmari
In model checking, reduction techniques can be helpful tools to fight the state-space explosion problem. Partial-order reduction (POR) is a well-known example, and many POR variants have been developed over the years. However, none of these can be used in the context of model checking stutter-sensitive temporal properties. We propose POR techniques for parity games, a well-established formalism for solving a variety of decision problems, including model checking. As a result, we obtain the first POR method that is sound for the full modal \(\upmu \)-calculus. We show how our technique can be applied to the fixed point logic called parameterised Boolean equation systems, which provides a high-level representation of parity games. Experiments with our implementation indicate that substantial reductions can be achieved.