Follow
Thorsten Wi▀mann
Title
Cited by
Cited by
Year
Nominal automata with name binding
L Schr÷der, D Kozen, S Milius, T Wi▀mann
International Conference on Foundations of Software Science and Computationá…, 2017
262017
Efficient coalgebraic partition refinement
U Dorsch, S Milius, L Schr÷der, T Wi▀mann
arXiv preprint arXiv:1705.08362, 2017
242017
On finitary functors
J Adßmek, S Milius, L Sousa, T Wissmann
arXiv preprint arXiv:1902.05788, 2019
152019
Regular behaviours with names
S Milius, L Schr÷der, T Wi▀mann
Applied Categorical Structures 24 (5), 663-701, 2016
142016
Generic partition refinement and weighted tree automata
HP Deifel, S Milius, L Schr÷der, T Wi▀mann
International Symposium on Formal Methods, 280-297, 2019
122019
Efficient and modular coalgebraic partition refinement
T Wi▀mann, U Dorsch, S Milius, L Schr÷der
arXiv preprint arXiv:1806.05654, 2018
122018
A new foundation for finitary corecursion
S Milius, D Pattinson, T Wi▀mann
International Conference on Foundations of Software Science and Computationá…, 2016
102016
Cool – A Generic Reasoner for Coalgebraic Hybrid Logics (System Description)
D GorÝn, D Pattinson, L Schr÷der, F Widmann, T Wi▀mann
International Joint Conference on Automated Reasoning, 396-402, 2014
102014
Finitary corecursion for the infinitary lambda calculus
S Milius, T Wi▀mann
arXiv preprint arXiv:1505.07736, 2015
92015
A coalgebraic view on reachability
T Wi▀mann, S Milius, S Katsumata, J Dubut
arXiv preprint arXiv:1901.10717, 2019
82019
A new foundation for finitary corecursion and iterative algebras
S Milius, D Pattinson, T Wi▀mann
Information and Computation 271, 104456, 2020
72020
Path category for free
T Wi▀mann, J Dubut, S Katsumata, I Hasuo
International Conference on Foundations of Software Science and Computationá…, 2019
72019
A new approach for active automata learning based on apartness
F Vaandrager, B Garhewal, J Rot, T Wi▀mann
International Conference on Tools and Algorithms for the Construction andá…, 2022
62022
Coalgebraic semantics and minimization in sets and beyond
T Wi▀mann
Friedrich-Alexander-Universitńt Erlangen-NŘrnberg (FAU), 2020
62020
Predicate liftings and functor presentations in coalgebraic expression languages
U Dorsch, S Milius, L Schr÷der, T Wi▀mann
International Workshop on Coalgebraic Methods in Computer Science, 56-77, 2018
52018
From generic partition refinement to weighted tree automata minimization
T Wi▀mann, HP Deifel, S Milius, L Schr÷der
Formal Aspects of Computing 33 (4), 695-727, 2021
42021
Explaining Behavioural Inequivalence Generically in Quasilinear Time
T Wi▀mann, S Milius, L Schr÷der
arXiv preprint arXiv:2105.00669, 2021
32021
Finitely presentable algebras for finitary monads
J Adßmek, S Milius, L Sousa, T Wi▀mann
arXiv preprint arXiv:1909.02524, 2019
32019
A coalgebraic treatment of conditional transition systems with upgrades
H Beohar, B K÷nig, S KŘpper, A Silva, T Wi▀mann
arXiv preprint arXiv:1612.05002, 2016
32016
On finitary functors and finitely presentable algebras
J Adßmek, S Milius, L Sousa, T Wi▀mann
preprint, 1902
31902
The system can't perform the operation now. Try again later.
Articles 1–20