Anton Wijs

activity

20112024

most citedA simpler O(m log n) algorithm for branching bisimilarity on labelled transition systems

23 citations · 54 across the 12 of their papers we have counts for

collaborators

Showing 2016Show all

2 papers · 1 filter

cs.DS2016

Proceedings Second Graphs as Models Workshop

Alexander Heußner, Aleks Kissinger, Anton Wijs

Graphs are used as models in all areas of computer science: examples are state space graphs, control flow graphs, syntax graphs, UML-type models of all kinds, network layouts, soci…

cs.LO2016

An O(m log n) Algorithm for Stuttering Equivalence and Branching Bisimulation

Jan Friso Groote, Anton Wijs

We provide a new algorithm to determine stuttering equivalence with time complexity $O (m lo g n)$ , where $n$ is the number of states and $m$ is the number of transitions of a Kripk…