Theoretische Informatik

This is an old revision of the document!

Thorsten Wißmann

Room: 11.155, E-Mail: thorsten.wissmann at fau dot de, Phone: +49 9131 85-64032

About me

I am a PhD student at Chair for Theoretical Computer Science of Friedrich-Alexander University of Erlangen and Nürnberg.

Coalgebraic Partition Refinement


  • The rational fixed point in nominal sets and its application to infinitary lambda-calculus, master-project report during the master studies in computer science (this is not my master thesis!), PDF.
  • Transforming OWL ontologies with bounded self-reference to plain OWL ontologies, bachelor thesis, PDF.


[10] Path category for free - Open morphisms from coalgebras with non-deterministic branching (Thorsten Wißmann, Jérémy Dubut, Shin-ya Katsumata, Ichiro Hasuo), In Proceedings of the 22nd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'19), 2019. (to appear) [bib] [pdf]
[9] A coalgebraic treatment of conditional transition systems with upgrades (Harsh Beohar, Barbara König, Sebastian Küpper, Alexandra Silva, Thorsten Wißmann), In Logical Methods in Computer Science, vol. Volume 14, Issue 1, 2018. [bib] [pdf] [doi]
[8] Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages (Ulrich Dorsch, Stefan Milius, Lutz Schröder, Thorsten Wißmann), Chapter in Coalgebraic Methods in Computer Science, pp. 56–77, Springer International Publishing, 2018. [bib] [pdf] [doi]
[7] Nominal Automata with Name binding (Lutz Schröder, Dexter Kozen, Stefan Milius, Thorsten Wißmann), In Proc. 20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2017) (Javier Esparza, Andrzej Murawski, eds.), Lecture Notes Comput. Sci. (ARCoSS), vol. 10203, pp. 124–142, Springer, 2017. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-54458-7_8. [bib] [pdf]
[6] Efficient Coalgebraic Partition Refinement (Ulrich Dorsch, Stefan Milius, Lutz Schröder, Thorsten Wißmann), In Proc. 28th International Conference on Concurrency Theory (CONCUR 2017), LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [bib] [pdf]
[5] Regular Behaviours with Names (Stefan Milius, Lutz Schröder, Thorsten Wißmann), In Applied Categorical Structures, vol. 24(5), pp. 663–701, 2016. [bib] [pdf] [doi]
[4] A New Foundation for Finitary Corecursion - The Locally Finite Fixpoint and Its Properties (Stefan Milius, Dirk Pattinson, Thorsten Wißmann), In Foundations of Software Science and Computation Structures - 19th International Conference, FOSSACS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings, pp. 107–125, 2016. [bib] [pdf] [doi]
[3] Finitary Corecursion for the Infinitary Lambda Calculus (Stefan Milius, Thorsten Wißmann), In Proc. 6th Conference on Algebra and Coalgebra in Computer Science, CALCO 2015, Leibniz International Proceedings in Informatics, 2015. [bib] [pdf]
[2] COOL -- A Generic Reasoner for Coalgebraic Hybrid Logics (System Description) (Daniel Gorín, Dirk Pattinson, Lutz Schröder, Florian Widmann, Thorsten Wißmann), In Proc. 7th Internat. Joint Conf. on Automated Reasoning, IJCAR 2014 (Stéphane Demri, Deepak Kapur, Christoph Weidenbach, eds.), Lect. Notes Comput. Sci., vol. 8562, pp. 396–402, Springer, 2014. [bib] [pdf]
[1] Reasoning with Bounded Self-reference Using Logical Interpreters (Daniel Gorín, Lutz Schröder, Thorsten Wißmann), In 26th International Workshop on Description Logics, DL 2013 (Thomas Eiter, Birte Glimm, Yevgeny Kazakov, Markus Krötzsch, eds.), CEUR Workshop Proceedings, vol. 1014, pp. 689–703, CEUR-WS.org, 2013. [bib] [pdf]
Powered by bibtexbrowser