11 citations · 37 across the 18 of their papers we have counts for
28 papers
Algebraic Language Theory with Effects
Fabian Lenke, Stefan Milius, Henning Urbat +1
Regular languages -- the languages accepted by deterministic finite automata -- are known to be precisely the languages recognized by finite monoids. This characterization is the o…
Initial Algebras Unchained -- A Novel Initial Algebra Construction Formalized in Agda
Thorsten Wißmann, Stefan Milius
The initial algebra for an endofunctor F provides a recursion and induction scheme for data structures whose constructors are described by F. The initial-algebra construction by Ad…
Bisimilar States in Uncertain Structures
Jurriaan Rot, Thorsten Wißmann
We provide a categorical notion called uncertain bisimilarity, which allows to reason about bisimilarity in combination with a lack of knowledge about the involved systems. Such un…
Action Codes
Frits Vaandrager, Thorsten Wißmann
We provide a new perspective on the problem how high-level state machine models with abstract actions can be related to low-level models in which these actions are refined by seque…
Weighted and Branching Bisimilarities from Generalized Open Maps
Jérémy Dubut, Thorsten Wißmann
In the open map approach to bisimilarity, the paths and their runs in a given state-based system are the first-class citizens, and bisimilarity becomes a derived notion. While open…
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…