25 citations · 124 across the 16 of their papers we have counts for
4 papers · 1 filter
Games for Bisimulations and Abstraction
David De Frutos Escrig, Jeroen J. A. Keiren, Tim A. C. Willemse
Weak bisimulations are typically used in process algebras where silent steps are used to abstract from internal behaviours. They facilitate relating implementations to specificatio…
Parity Game Reductions
S. Cranen, J. J. A. Keiren, T. A. C. Willemse
Parity games play a central role in model checking and satisfiability checking. Solving parity games is computationally expensive, among others due to the size of the games, which,…
Stuttering equivalence is too slow!
David N. Jansen, Jeroen J. A. Keiren
Groote and Wijs recently described an algorithm for deciding stuttering equivalence and branching bisimulation equivalence, acclaimed to run in time. Unfort…
Corrections to A Menagerie of Timed Automata
Jeroen J. A. Keiren, Peter Fontana, Rance Cleaveland
This note corrects a technical error in the ACM Computing Surveys paper mentioned in the title. The flaw involved constructions for showing that timed automata with urgent location…