Thorsten Wißmann


Lehrstuhl für Informatik 8 (Theoretische Informatik)

Project member

COAX: Coinduction Meets Algebra For the Axiomatization of System Equivalence
apl. Prof. Dr. Stefan Milius; Prof. Dr. Lutz Schröder
(01/10/2014 - 31/07/2018)

Publications (Download BibTeX)

Wißmann, T., Dubut, J., Katsumata, S.y., & Hasuo, I. (2019). Path Category for Free: Open Morphisms from Coalgebras with Non-deterministic Branching. In Mikolaj Bojanczyk, Alex Simpson (Eds.), Proceedings of the 22nd International Conference, FOSSACS 2019 (pp. 523-540). Springer Verlag.
Harsh, B., König, B., Küpper, S., Silva, A., & Wißmann, T. (2018). A coalgebraic treatment of conditional transition systems with upgrades. Logical Methods in Computer Science, Volume 14, Issue 1.
Dorsch, U., Milius, S., Schröder, L., & Wißmann, T. (2018). Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages. In Corina Cîrstea (Eds.), Proc.~Coalgebraic Methods in Computer Science (CMCS'18). Thessaloniki: Springer.
Dorsch, U., Milius, S., Schröder, L., & Wißmann, T. (2017). Efficient Coalgebraic Partition Refinement. In Meyer R, Nestmann U (Eds.), Proc. 28th International Conference on Concurrency Theory (CONCUR 2017) (pp. 28:1--28:16). Schloss Dagstuhl.
Schröder, L., Kozen, D., Milius, S., & Wißmann, T. (2017). Nominal Automata with Name binding. In Esparza Javier, Murawski Andrzej (Eds.), Proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2017). Uppsala, SE: Springer.
Milius, S., Pattinson, D., & Wißmann, T. (2016). A New Foundation for Finitary Corecursion. In Foundations of Software Science and Computation Structures (pp. 107-125). Eindhoven, The Netherlands.
Milius, S., Schröder, L., & Wißmann, T. (2016). Regular Behaviours with Names - On Rational Fixpoints of Endofunctors on Nominal Sets. Applied Categorical Structures, 24(5), 663--701.
Milius, S., & Wißmann, T. (2015). Finitary Corecursion for the Infinitary Lambda Calculus. In Proc. 6th Conference on Algebra and Coalgebra in Computer Science, CALCO 2015 (pp. 336-351). Nijmegen (NL): Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik.
Gorin, D., Pattinson, D., Schröder, L., Widmann, F., & Wißmann, T. (2014). COOL — A Generic Reasoner for Coalgebraic Hybrid Logics (System Description). In Automated Reasoning (pp. 396-402). Wien: Berlin: Springer.
Gorin, D., Schröder, L., & Wißmann, T. (2013). Reasoning with Bounded Self-reference Using Logical Interpreters. In Proc. 26th International Workshop on Description Logics, DL 2013 (pp. 689-703). Ulm: Aachen:

Last updated on 2016-05-05 at 05:29