10 citations · 10 across the 1 of their papers we have counts for
3 papers
cs.DC2021★ 10 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.FL2020
Regular resynchronizability of origin transducers is undecidable
Denis Kuperberg, Jan Martens
We study the relation of containment up to unknown regular resynchronization between two-way non-deterministic transducers. We show that it constitutes a preorder, and that the cor…