Thorsten Wißmann

According to our database, Thorsten Wißmann authored at least 35 papers between 2013 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Algebraic Language Theory with Effects.

Fabian Birkmann, Stefan Milius, Henning Urbat, Thorsten Wißmann

CoRR, 2024

Initial Algebras Unchained - A Novel Initial Algebra Construction Formalized in Agda.

Thorsten Wißmann, Stefan Milius

Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

2023

Fast Coalgebraic Bisimilarity Minimization.

Jules Jacobs, Thorsten Wißmann

Proc. ACM Program. Lang., January, 2023

Action Codes.

Frits W. Vaandrager, Thorsten Wißmann

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Weighted and Branching Bisimilarities from Generalized Open Maps.

Jérémy Dubut, Thorsten Wißmann

Proceedings of the Foundations of Software Science and Computation Structures, 2023

Supported Sets - A New Foundation for Nominal Sets and Automata.

Thorsten Wißmann

Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

Bisimilar States in Uncertain Structures.

Jurriaan Rot, Thorsten Wißmann

Proceedings of the 10th Conference on Algebra and Coalgebra in Computer Science, 2023

2022

Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence.

Thorsten Wißmann, Stefan Milius, Lutz Schröder

Log. Methods Comput. Sci., 2022

Minimality Notions via Factorization Systems and Examples.

Thorsten Wißmann

Log. Methods Comput. Sci., 2022

Coalgebraic Partition Refinement For All Functors.

Jules Jacobs, Thorsten Wißmann

CoRR, 2022

A New Approach for Active Automata Learning Based on Apartness.

Frits W. Vaandrager, Bharat Garhewal, Jurriaan Rot, Thorsten Wißmann

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2022

State Identification and Verification with Satisfaction.

Joshua Moerman, Thorsten Wißmann

Proceedings of the A Journey from Process Algebra via Timed Automata to Model Learning, 2022

2021

From generic partition refinement to weighted tree automata minimization.

Thorsten Wißmann, Hans-Peter Deifel, Stefan Milius, Lutz Schröder

Formal Aspects Comput., 2021

Minimality Notions via Factorization Systems.

Thorsten Wißmann

CoRR, 2021

Coalgebra Encoding for Efficient Minimization.

Hans-Peter Deifel, Stefan Milius, Thorsten Wißmann

Proceedings of the 6th International Conference on Formal Structures for Computation and Deduction, 2021

Explaining Behavioural Inequivalence Generically in Quasilinear Time.

Thorsten Wißmann, Stefan Milius, Lutz Schröder

Proceedings of the 32nd International Conference on Concurrency Theory, 2021

Minimality Notions via Factorization Systems ((Co)algebraic pearls).

Thorsten Wißmann

Proceedings of the 9th Conference on Algebra and Coalgebra in Computer Science, 2021

2020

Coalgebraic Semantics and Minimization in Sets and Beyond.

Thorsten Wißmann

PhD thesis, 2020

Efficient and Modular Coalgebraic Partition Refinement.

Thorsten Wißmann, Ulrich Dorsch, Stefan Milius, Lutz Schröder

Log. Methods Comput. Sci., 2020

A new foundation for finitary corecursion and iterative algebras.

Stefan Milius, Dirk Pattinson, Thorsten Wißmann

Inf. Comput., 2020

2019

Path Category for Free - Open Morphisms from Coalgebras with Non-deterministic Branching.

Thorsten Wißmann, Jérémy Dubut, Shin-ya Katsumata, Ichiro Hasuo

Proceedings of the Foundations of Software Science and Computation Structures, 2019

Generic Partition Refinement and Weighted Tree Automata.

Hans-Peter Deifel, Stefan Milius, Lutz Schröder, Thorsten Wißmann

Proceedings of the Formal Methods - The Next 30 Years - Third World Congress, 2019

2018

A coalgebraic treatment of conditional transition systems with upgrades.

Harsh Beohar, Barbara König, Sebastian Küpper, Alexandra Silva, Thorsten Wißmann

Log. Methods Comput. Sci., 2018

CoPaR: An Efficient Generic Partition Refiner.

Hans-Peter Deifel, Stefan Milius, Lutz Schröder, Thorsten Wißmann

CoRR, 2018

Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages.

Ulrich Dorsch, Stefan Milius, Lutz Schröder, Thorsten Wißmann

Proceedings of the Coalgebraic Methods in Computer Science, 2018

2017

A Coalgebraic Paige-Tarjan Algorithm.

Ulrich Dorsch, Stefan Milius, Lutz Schröder, Thorsten Wißmann

CoRR, 2017

Nominal Automata with Name Binding.

Lutz Schröder, Dexter Kozen, Stefan Milius, Thorsten Wißmann

Proceedings of the Foundations of Software Science and Computation Structures, 2017

Efficient Coalgebraic Partition Refinement.

Ulrich Dorsch, Stefan Milius, Lutz Schröder, Thorsten Wißmann

Proceedings of the 28th International Conference on Concurrency Theory, 2017

2016

Regular Behaviours with Names.

Stefan Milius, Lutz Schröder, Thorsten Wißmann

CoRR, 2016

A New Foundation for Finitary Corecursion.

Stefan Milius, Dirk Pattinson, Thorsten Wißmann

CoRR, 2016

Regular Behaviours with Names - On Rational Fixpoints of Endofunctors on Nominal Sets.

Stefan Milius, Lutz Schröder, Thorsten Wißmann

Appl. Categorical Struct., 2016

A New Foundation for Finitary Corecursion - The Locally Finite Fixpoint and Its Properties.

Stefan Milius, Dirk Pattinson, Thorsten Wißmann

Proceedings of the Foundations of Software Science and Computation Structures, 2016

2015

Finitary Corecursion for the Infinitary Lambda Calculus.

Stefan Milius, Thorsten Wißmann

Proceedings of the 6th Conference on Algebra and Coalgebra in Computer Science, 2015

2014

Cool - A Generic Reasoner for Coalgebraic Hybrid Logics (System Description).

Daniel Gorín, Dirk Pattinson, Lutz Schröder, Florian Widmann, Thorsten Wißmann

Proceedings of the Automated Reasoning - 7th International Joint Conference, 2014

2013

Reasoning with Bounded Self-reference Using Logical Interpreters.

Daniel Gorín, Lutz Schröder, Thorsten Wißmann

Proceedings of the Informal Proceedings of the 26th International Workshop on Description Logics, Ulm, Germany, July 23, 2013