Thorsten Wißmann

Orcid: 0000-0001-8993-6486

Affiliations:
  • University of Erlangen-Nuremberg, Germany
  • Radboud University, Nijmegen, The Netherlands (former)


According to our database1, Thorsten Wißmann authored at least 33 papers between 2013 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Fast Coalgebraic Bisimilarity Minimization.
Proc. ACM Program. Lang., January, 2023

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

Weighted and Branching Bisimilarities from Generalized Open Maps.
Proceedings of the Foundations of Software Science and Computation Structures, 2023

Supported Sets - A New Foundation for Nominal Sets and Automata.
Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

Bisimilar States in Uncertain Structures.
Proceedings of the 10th Conference on Algebra and Coalgebra in Computer Science, 2023

2022
Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence.
Log. Methods Comput. Sci., 2022

Minimality Notions via Factorization Systems and Examples.
Log. Methods Comput. Sci., 2022

Coalgebraic Partition Refinement For All Functors.
CoRR, 2022

A New Approach for Active Automata Learning Based on Apartness.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2022

State Identification and Verification with Satisfaction.
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.
Formal Aspects Comput., 2021

Minimality Notions via Factorization Systems.
CoRR, 2021

Coalgebra Encoding for Efficient Minimization.
Proceedings of the 6th International Conference on Formal Structures for Computation and Deduction, 2021

Explaining Behavioural Inequivalence Generically in Quasilinear Time.
Proceedings of the 32nd International Conference on Concurrency Theory, 2021

Minimality Notions via Factorization Systems ((Co)algebraic pearls).
Proceedings of the 9th Conference on Algebra and Coalgebra in Computer Science, 2021

2020
Coalgebraic Semantics and Minimization in Sets and Beyond.
PhD thesis, 2020

Efficient and Modular Coalgebraic Partition Refinement.
Log. Methods Comput. Sci., 2020

A new foundation for finitary corecursion and iterative algebras.
Inf. Comput., 2020

2019
Path Category for Free - Open Morphisms from Coalgebras with Non-deterministic Branching.
Proceedings of the Foundations of Software Science and Computation Structures, 2019

Generic Partition Refinement and Weighted Tree Automata.
Proceedings of the Formal Methods - The Next 30 Years - Third World Congress, 2019

2018
A coalgebraic treatment of conditional transition systems with upgrades.
Log. Methods Comput. Sci., 2018

CoPaR: An Efficient Generic Partition Refiner.
CoRR, 2018

Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages.
Proceedings of the Coalgebraic Methods in Computer Science, 2018

2017
A Coalgebraic Paige-Tarjan Algorithm.
CoRR, 2017

Nominal Automata with Name Binding.
Proceedings of the Foundations of Software Science and Computation Structures, 2017

Efficient Coalgebraic Partition Refinement.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

2016
Regular Behaviours with Names.
CoRR, 2016

A New Foundation for Finitary Corecursion.
CoRR, 2016

Regular Behaviours with Names - On Rational Fixpoints of Endofunctors on Nominal Sets.
Appl. Categorical Struct., 2016

A New Foundation for Finitary Corecursion - The Locally Finite Fixpoint and Its Properties.
Proceedings of the Foundations of Software Science and Computation Structures, 2016

2015
Finitary Corecursion for the Infinitary Lambda Calculus.
Proceedings of the 6th Conference on Algebra and Coalgebra in Computer Science, 2015

2014
Cool - A Generic Reasoner for Coalgebraic Hybrid Logics (System Description).
Proceedings of the Automated Reasoning - 7th International Joint Conference, 2014

2013
Reasoning with Bounded Self-reference Using Logical Interpreters.
Proceedings of the Informal Proceedings of the 26th International Workshop on Description Logics, Ulm, Germany, July 23, 2013


  Loading...