| 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 | 43 | 2022 |
| Nominal automata with name binding L Schröder, D Kozen, S Milius, T Wißmann Foundations of Software Science and Computation Structures: 20th …, 2017 | 35 | 2017 |
| Efficient coalgebraic partition refinement U Dorsch, S Milius, L Schröder, T Wißmann arXiv preprint arXiv:1705.08362, 2017 | 26 | 2017 |
| On finitary functors J Adámek, S Milius, L Sousa, T Wißmann arXiv preprint arXiv:1902.05788, 2019 | 24 | 2019 |
| Generic partition refinement and weighted tree automata HP Deifel, S Milius, L Schröder, T Wißmann Formal Methods–The Next 30 Years: Third World Congress, FM 2019, Porto …, 2019 | 16 | 2019 |
| Regular behaviours with names: On rational fixpoints of endofunctors on nominal sets S Milius, L Schröder, T Wißmann Applied Categorical Structures 24, 663-701, 2016 | 15 | 2016 |
| Efficient and modular coalgebraic partition refinement T Wißmann, U Dorsch, S Milius, L Schröder Logical Methods in Computer Science 16, 2020 | 14 | 2020 |
| 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 | 14 | 2014 |
| A new foundation for finitary corecursion: The locally finite fixpoint and its properties S Milius, D Pattinson, T Wißmann International Conference on Foundations of Software Science and Computation …, 2016 | 12 | 2016 |
| Path Category for Free: Open Morphisms from Coalgebras with Non-deterministic Branching T Wißmann, J Dubut, S Katsumata, I Hasuo Foundations of Software Science and Computation Structures: 22nd …, 2019 | 10 | 2019 |
| Finitary corecursion for the infinitary lambda calculus S Milius, T Wißmann arXiv preprint arXiv:1505.07736, 2015 | 9 | 2015 |
| A new foundation for finitary corecursion and iterative algebras S Milius, D Pattinson, T Wißmann Information and Computation 271, 104456, 2020 | 7 | 2020 |
| Finitely presentable algebras for finitary monads J Adámek, S Milius, L Sousa, T Wißmann arXiv preprint arXiv:1909.02524, 2019 | 7 | 2019 |
| A coalgebraic view on reachability T Wißmann, S Milius, S Katsumata, J Dubut arXiv preprint arXiv:1901.10717, 2019 | 7 | 2019 |
| 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 | 6 | 2021 |
| Explaining behavioural inequivalence generically in quasilinear time T Wißmann, S Milius, L Schröder arXiv preprint arXiv:2105.00669, 2021 | 6 | 2021 |
| Coalgebraic semantics and minimization in sets and beyond T Wißmann Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU), 2020 | 5 | 2020 |
| 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 | 5 | 2018 |
| Fast coalgebraic bisimilarity minimization J Jacobs, T Wißmann Proceedings of the ACM on Programming Languages 7 (POPL), 1514-1541, 2023 | 4 | 2023 |
| A coalgebraic treatment of conditional transition systems with upgrades H Beohar, B König, S Küpper, A Silva, T Wißmann Logical Methods in Computer Science 14, 2018 | 3 | 2018 |
Stefan MiliusFAU Erlangen-NürnbergVerified email at stefan-milius.eu
