activity
20122021
most citedA linear parallel algorithm to compute bisimulation and relational coarsest partitions

10 citations · 30 across the 5 of their papers we have counts for

collaborators

6 papers

cs.DC202110 cited

A linear parallel algorithm to compute bisimulation and relational coarsest partitions

Jan Martens, Jan Friso Groote, Lars van den Haak +2

The most efficient way to calculate strong bisimilarity is by calculation the relational coarsest partition on a transition system. We provide the first linear time algorithm to ca…

cs.DC2020

Term Rewriting on GPUs

Johri van Eerd, Jan Friso Groote, Pieter Hijma +2

We present a way to implement term rewriting on a GPU. We do this by letting the GPU repeatedly perform a massively parallel evaluation of all subterms. We find that if the term re…

cs.DC20178 cited

On the Scalability of the GPUexplore Explicit-State Model Checker

Nathan Cassee, Thomas Neele, Anton Wijs

The use of graphics processors (GPUs) is a promising approach to speed up model checking to such an extent that it becomes feasible to instantly verify software systems during deve…

cs.DC20177 cited

Analysing the Performance of GPU Hash Tables for State Space Exploration

Nathan Cassee, Anton Wijs

In the past few years, General Purpose Graphics Processors (GPUs) have been used to significantly speed up numerous applications. One of the areas in which GPUs have recently led t…

cs.LO20155 cited

Confluence Detection for Transformations of Labelled Transition Systems

Anton Wijs

The development of complex component software systems can be made more manageable by first creating an abstract model and then incrementally adding details. Model transformation is…

cs.DS2012

Proceedings First Workshop on GRAPH Inspection and Traversal Engineering

Anton Wijs, Dragan Bošnački, Stefan Edelkamp

These are the proceedings of the First Workshop on GRAPH Inspection and Traversal Engineering (GRAPHITE 2012), which took place on April 1, 2012 in Tallinn, Estonia, as a satellite…