Explore projects
-
-
Package fsm implements a simple finite state (Mealy) machine.
Updated -
Package partition can be used to construct the coarsest refinement of a partition P of a set N of integers [0, n) with respect to one or more functions of type N->N.
Updated -
Several sets of benchmarks for the two partition refinement algorithms found in the gitlab.science.ru.nl/rick/partition repository.
Updated -
-
-
Authors: Rauf Mahmudlu, Halim Munawar, Moritz Neikes, Niels Samwel
Updated -
New implementation of diagonalization code, written for python wrapping.
Updated -
Updated
-
We compare the existing RA learners (Tomte and RALib) on a set of benchmarks and analyze the statistics. The project includes the binaries of the tools, as well as scripts that automatically generate models, run and collect data.
Updated -
Basic learner setup, using learnlib/automatalib, containing an example SUL and a socket-interface to connect a SUL over TCP.
Updated -
-
-
A project where we develop some of the (Java) data-structures that we use in Tomte
Updated -
Markus Klinik / program-analysis
MIT LicenseA compiler and static cost analyzer for a simplified variant of iTasks
Updated -
THIS IS A MIRROR!!!
Please add issues and pull requests on https://github.com/timjs/itasks-ide
Updated -
THIS IS A MIRROR!!!
Please add issues and pull requests on https://github.com/timjs/clean-base
Updated -
THIS IS A MIRROR!!!
Please add issues and pull requests on https://github.com/timjs/clean-scrub
Updated -
This repo is for a publication which aims at unifying the ICTAC 2015 paper with related theoretical elements introduced by Judith's Master's dissertation. The target journal is: http://journals.cambridge.org/jid_MSC
Updated -
Updated