Reasoning with Bounded Self-reference Using Logical Interpreters. - Daniel Gorín; Lutz Schröder; Thorsten Wißmann (Description Logics, 2013)

Cool - A Generic Reasoner for Coalgebraic Hybrid Logics (System Description). - Daniel Gorín; Dirk Pattinson; Lutz Schröder; Florian Widmann; Thorsten Wißmann (IJCAR, 2014)

Finitary Corecursion for the Infinitary Lambda Calculus. - Stefan Milius; Thorsten Wißmann (CALCO, 2015)

A New Foundation for Finitary Corecursion - The Locally Finite Fixpoint and Its Properties. - Stefan Milius; Dirk Pattinson; Thorsten Wißmann (FoSSaCS, 2016)

Regular Behaviours with Names - On Rational Fixpoints of Endofunctors on Nominal Sets. - Stefan Milius; Lutz Schröder; Thorsten Wißmann (Appl. Categorical Struct., 2016)

A New Foundation for Finitary Corecursion. - Stefan Milius; Dirk Pattinson; Thorsten Wißmann (CoRR, 2016)

Regular Behaviours with Names. - Stefan Milius; Lutz Schröder; Thorsten Wißmann (CoRR, 2016)

Efficient Coalgebraic Partition Refinement. - Ulrich Dorsch; Stefan Milius; Lutz Schröder; Thorsten Wißmann (CONCUR, 2017)

Nominal Automata with Name Binding. - Lutz Schröder; Dexter Kozen; Stefan Milius; Thorsten Wißmann (FoSSaCS, 2017)

A Coalgebraic Paige-Tarjan Algorithm. - Ulrich Dorsch; Stefan Milius; Lutz Schröder; Thorsten Wißmann (CoRR, 2017)

Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages. - Ulrich Dorsch; Stefan Milius; Lutz Schröder; Thorsten Wißmann (CMCS, 2018)

CoPaR: An Efficient Generic Partition Refiner. - Hans-Peter Deifel; Stefan Milius; Lutz Schröder; Thorsten Wißmann (CoRR, 2018)

A coalgebraic treatment of conditional transition systems with upgrades. - Harsh Beohar; Barbara König 001; Sebastian Küpper; Alexandra Silva 001; Thorsten Wißmann (Log. Methods Comput. Sci., 2018)

Generic Partition Refinement and Weighted Tree Automata. - Hans-Peter Deifel; Stefan Milius; Lutz Schröder; Thorsten Wißmann (FM, 2019)

Path Category for Free - Open Morphisms from Coalgebras with Non-deterministic Branching. - Thorsten Wißmann; Jérémy Dubut; Shin-ya Katsumata; Ichiro Hasuo (FoSSaCS, 2019)

A new foundation for finitary corecursion and iterative algebras. - Stefan Milius; Dirk Pattinson; Thorsten Wißmann (Inf. Comput., 2020)

Efficient and Modular Coalgebraic Partition Refinement. - Thorsten Wißmann; Ulrich Dorsch; Stefan Milius; Lutz Schröder (Log. Methods Comput. Sci., 2020)

Coalgebraic Semantics and Minimization in Sets and Beyond. - Thorsten Wißmann (2020)

Minimality Notions via Factorization Systems ((Co)algebraic pearls). - Thorsten Wißmann (CALCO, 2021)

Explaining Behavioural Inequivalence Generically in Quasilinear Time. - Thorsten Wißmann; Stefan Milius; Lutz Schröder (CONCUR, 2021)

Coalgebra Encoding for Efficient Minimization. - Hans-Peter Deifel; Stefan Milius; Thorsten Wißmann (FSCD, 2021)

Minimality Notions via Factorization Systems. - Thorsten Wißmann (CoRR, 2021)

From generic partition refinement to weighted tree automata minimization. - Thorsten Wißmann; Hans-Peter Deifel; Stefan Milius; Lutz Schröder (Formal Aspects Comput., 2021)

State Identification and Verification with Satisfaction. - Joshua Moerman; Thorsten Wißmann (A Journey from Process Algebra via Timed Automata to Model Learning, 2022)

A New Approach for Active Automata Learning Based on Apartness. - Frits W. Vaandrager; Bharat Garhewal; Jurriaan Rot; Thorsten Wißmann (TACAS (1), 2022)

Coalgebraic Partition Refinement For All Functors. - Jules Jacobs; Thorsten Wißmann (CoRR, 2022)

Minimality Notions via Factorization Systems and Examples. - Thorsten Wißmann (Log. Methods Comput. Sci., 2022)

Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence. - Thorsten Wißmann; Stefan Milius; Lutz Schröder (Log. Methods Comput. Sci., 2022)

Bisimilar States in Uncertain Structures. - Jurriaan Rot; Thorsten Wißmann (CALCO, 2023)

Supported Sets - A New Foundation for Nominal Sets and Automata. - Thorsten Wißmann (CSL, 2023)

Weighted and Branching Bisimilarities from Generalized Open Maps. - Jérémy Dubut; Thorsten Wißmann (FoSSaCS, 2023)

Action Codes. - Frits W. Vaandrager; Thorsten Wißmann (ICALP, 2023)

Fast Coalgebraic Bisimilarity Minimization. - Jules Jacobs; Thorsten Wißmann (Proc. ACM Program. Lang., 2023)

Initial Algebras Unchained - A Novel Initial Algebra Construction Formalized in Agda. - Thorsten Wißmann; Stefan Milius (LICS, 2024)

Algebraic Language Theory with Effects. - Fabian Birkmann; Stefan Milius; Henning Urbat; Thorsten Wißmann (CoRR, 2024)

Trees in Coalgebra from Generalized Reachability ((Co)algebraic pearl). - Thorsten Wißmann; Bálint Kocsis; Jurriaan Rot; Ruben Turkenburg (CALCO, 2025)

Algebraic Language Theory with Effects. - Fabian Lenke; Stefan Milius; Henning Urbat; Thorsten Wißmann (ICALP, 2025)

Trees in Coalgebra from Generalized Reachability. - Thorsten Wißmann; Bálint Kocsis; Jurriaan Rot; Ruben Turkenburg (CoRR, 2025)

Well-Founded Coalgebras Meet König's Lemma. - Henning Urbat; Thorsten Wißmann (CoRR, 2025)