11 citations · 37 across the 18 of their papers we have counts for
4 papers · 1 filter
Fast Coalgebraic Bisimilarity Minimization
Jules Jacobs, Thorsten Wißmann
Coalgebraic bisimilarity minimization generalizes classical automaton minimization to a large class of automata whose transition structure is specified by a functor, subsuming stro…
Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence
Thorsten Wißmann, Stefan Milius, Lutz Schröder
We provide a generic algorithm for constructing formulae that distinguish behaviourally inequivalent states in systems of various transition types such as nondeterministic, probabi…
Minimality Notions via Factorization Systems and Examples
Thorsten Wißmann
For the minimization of state-based systems (i.e. the reduction of the number of states while retaining the system's semantics), there are two obvious aspects: removing unnecessary…
Supported Sets -- A New Foundation For Nominal Sets And Automata
Thorsten Wißmann
The present work proposes and discusses the category of supported sets which provides a uniform foundation for nominal sets of various kinds, such as those for equality symmetry, f…