Thorsten Wißmann

59 papers A* 3A 1B 14Journal 36Unranked 4
YearRankTypeTitle / Venue / Authors
2026 J jnl
Formalized Run-Time Analysis of Active Learning - Coalgebraically in Agda.
CoRR
Thorsten Wißmann
2026 B conf
Well-Founded Coalgebras Meet Kőnig's Lemma.
CSL
Henning Urbat, Thorsten Wißmann
2025 A* conf
Algebraic Language Theory with Effects.
ICALP
Fabian Lenke, Stefan Milius, Henning Urbat, Thorsten Wißmann
2025 J jnl
Intrinsically Correct Algorithms and Recursive Coalgebras.
CoRR
Cass Alexandru, Henning Urbat, Thorsten Wißmann
2025 B conf
Trees in Coalgebra from Generalized Reachability ((Co)algebraic pearl).
CALCO
Thorsten Wißmann, Bálint Kocsis, Jurriaan Rot, Ruben Turkenburg
2025 J jnl
Trees in Coalgebra from Generalized Reachability.
CoRR
Thorsten Wißmann, Bálint Kocsis, Jurriaan Rot, Ruben Turkenburg
2025 J jnl
Well-Founded Coalgebras Meet König's Lemma.
CoRR
Henning Urbat, Thorsten Wißmann
2024 J jnl
Algebraic Language Theory with Effects.
CoRR
Fabian Birkmann, Stefan Milius, Henning Urbat, Thorsten Wißmann
2024 A* conf
Initial Algebras Unchained - A Novel Initial Algebra Construction Formalized in Agda.
LICS
Thorsten Wißmann, Stefan Milius
2024 J jnl
Initial Algebras Unchained - A Novel Initial Algebra Construction Formalized in Agda.
CoRR
Thorsten Wißmann, Stefan Milius
2023 A* conf
Action Codes.
ICALP
Frits W. Vaandrager, Thorsten Wißmann
2023 J jnl
Action Codes.
CoRR
Frits W. Vaandrager, Thorsten Wißmann
2023 B conf
Bisimilar States in Uncertain Structures.
CALCO
Jurriaan Rot, Thorsten Wißmann
2023 J jnl
Bisimilar States in Uncertain Structures.
CoRR
Jurriaan Rot, Thorsten Wißmann
2023 J jnl
Fast Coalgebraic Bisimilarity Minimization.
Proc. ACM Program. Lang.
Jules Jacobs, Thorsten Wißmann
2023 B conf
Supported Sets - A New Foundation for Nominal Sets and Automata.
CSL
Thorsten Wißmann
2023 B conf
Weighted and Branching Bisimilarities from Generalized Open Maps.
FoSSaCS
Jérémy Dubut, Thorsten Wißmann
2023 J jnl
Weighted and Branching Bisimilarities from Generalized Open Maps.
CoRR
Jérémy Dubut, Thorsten Wißmann
2022 — conf
A New Approach for Active Automata Learning Based on Apartness.
TACAS (1)
Frits W. Vaandrager, Bharat Garhewal, Jurriaan Rot, Thorsten Wißmann
2022 J jnl
Coalgebraic Partition Refinement For All Functors.
CoRR
Jules Jacobs, Thorsten Wißmann
2022 J jnl
Minimality Notions via Factorization Systems and Examples.
CoRR
Thorsten Wißmann
2022 J jnl
Minimality Notions via Factorization Systems and Examples.
Log. Methods Comput. Sci.
Thorsten Wißmann
2022 J jnl
Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence.
CoRR
Thorsten Wißmann, Stefan Milius, Lutz Schröder
2022 J jnl
Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence.
Log. Methods Comput. Sci.
Thorsten Wißmann, Stefan Milius, Lutz Schröder
2022 — conf
State Identification and Verification with Satisfaction.
A Journey from Process Algebra via Timed Automata to Model Learning
Joshua Moerman, Thorsten Wißmann
2022 J jnl
Supported Sets - A New Foundation For Nominal Sets And Automata.
CoRR
Thorsten Wißmann
2021 J jnl
A New Approach for Active Automata Learning Based on Apartness.
CoRR
Frits W. Vaandrager, Bharat Garhewal, Jurriaan Rot, Thorsten Wißmann
2021 B conf
Coalgebra Encoding for Efficient Minimization.
FSCD
Hans-Peter Deifel, Stefan Milius, Thorsten Wißmann
2021 J jnl
Coalgebra Encoding for Efficient Minimization.
CoRR
Hans-Peter Deifel, Stefan Milius, Thorsten Wißmann
2021 B conf
Explaining Behavioural Inequivalence Generically in Quasilinear Time.
CONCUR
Thorsten Wißmann, Stefan Milius, Lutz Schröder
2021 J jnl
Explaining Behavioural Inequivalence Generically in Quasilinear Time.
CoRR
Thorsten Wißmann, Stefan Milius, Lutz Schröder
2021 J jnl
From generic partition refinement to weighted tree automata minimization.
Formal Aspects Comput.
Thorsten Wißmann, Hans-Peter Deifel, Stefan Milius, Lutz Schröder
2021 B conf
Minimality Notions via Factorization Systems ((Co)algebraic pearls).
CALCO
Thorsten Wißmann
2021 J jnl
Minimality Notions via Factorization Systems.
CoRR
Thorsten Wißmann
2020 J jnl
A new foundation for finitary corecursion and iterative algebras.
Inf. Comput.
Stefan Milius, Dirk Pattinson, Thorsten Wißmann
2020 — —
Coalgebraic Semantics and Minimization in Sets and Beyond.
Thorsten Wißmann
2020 J jnl
Efficient and Modular Coalgebraic Partition Refinement.
Log. Methods Comput. Sci.
Thorsten Wißmann, Ulrich Dorsch, Stefan Milius, Lutz Schröder
2020 J jnl
From Generic Partition Refinement to Weighted Tree Automata Minimization.
CoRR
Thorsten Wißmann, Hans-Peter Deifel, Stefan Milius, Lutz Schröder
2019 B conf
Generic Partition Refinement and Weighted Tree Automata.
FM
Hans-Peter Deifel, Stefan Milius, Lutz Schröder, Thorsten Wißmann
2019 B conf
Path Category for Free - Open Morphisms from Coalgebras with Non-deterministic Branching.
FoSSaCS
Thorsten Wißmann, Jérémy Dubut, Shin-ya Katsumata, Ichiro Hasuo
2018 J jnl
A New Foundation for Finitary Corecursion and Iterative Algebras.
CoRR
Stefan Milius, Dirk Pattinson, Thorsten Wißmann
2018 J jnl
A coalgebraic treatment of conditional transition systems with upgrades.
Log. Methods Comput. Sci.
Harsh Beohar, Barbara König, Sebastian Küpper, Alexandra Silva, Thorsten Wißmann
2018 J jnl
CoPaR: An Efficient Generic Partition Refiner.
CoRR
Hans-Peter Deifel, Stefan Milius, Lutz Schröder, Thorsten Wißmann
2018 J jnl
Efficient and Modular Coalgebraic Partition Refinement.
CoRR
Thorsten Wißmann, Ulrich Dorsch, Stefan Milius, Lutz Schröder
2018 J jnl
Path category for free - Open morphisms from coalgebras with non-deterministic branching.
CoRR
Thorsten Wißmann, Jérémy Dubut, Shin-ya Katsumata, Ichiro Hasuo
2018 — conf
Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages.
CMCS
Ulrich Dorsch, Stefan Milius, Lutz Schröder, Thorsten Wißmann
2018 J jnl
Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages.
CoRR
Ulrich Dorsch, Stefan Milius, Lutz Schröder, Thorsten Wißmann
2017 J jnl
A Coalgebraic Paige-Tarjan Algorithm.
CoRR
Ulrich Dorsch, Stefan Milius, Lutz Schröder, Thorsten Wißmann
2017 B conf
Efficient Coalgebraic Partition Refinement.
CONCUR
Ulrich Dorsch, Stefan Milius, Lutz Schröder, Thorsten Wißmann
2017 B conf
Nominal Automata with Name Binding.
FoSSaCS
Lutz Schröder, Dexter Kozen, Stefan Milius, Thorsten Wißmann
2016 B conf
A New Foundation for Finitary Corecursion - The Locally Finite Fixpoint and Its Properties.
FoSSaCS
Stefan Milius, Dirk Pattinson, Thorsten Wißmann
2016 J jnl
A New Foundation for Finitary Corecursion.
CoRR
Stefan Milius, Dirk Pattinson, Thorsten Wißmann
2016 J jnl
Nominal Automata with Name Binding.
CoRR
Lutz Schröder, Dexter Kozen, Stefan Milius, Thorsten Wißmann
2016 J jnl
Regular Behaviours with Names - On Rational Fixpoints of Endofunctors on Nominal Sets.
Appl. Categorical Struct.
Stefan Milius, Lutz Schröder, Thorsten Wißmann
2016 J jnl
Regular Behaviours with Names.
CoRR
Stefan Milius, Lutz Schröder, Thorsten Wißmann
2015 B conf
Finitary Corecursion for the Infinitary Lambda Calculus.
CALCO
Stefan Milius, Thorsten Wißmann
2015 J jnl
Finitary Corecursion for the Infinitary Lambda Calculus.
CoRR
Stefan Milius, Thorsten Wißmann
2014 A conf
Cool - A Generic Reasoner for Coalgebraic Hybrid Logics (System Description).
IJCAR
Daniel Gorín, Dirk Pattinson, Lutz Schröder, Florian Widmann, Thorsten Wißmann
2013 — conf
Reasoning with Bounded Self-reference Using Logical Interpreters.
Description Logics
Daniel Gorín, Lutz Schröder, Thorsten Wißmann