default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThorsten Wißmann
Person information
- affiliation: University of Erlangen-Nuremberg, Germany
- affiliation (former): Radboud University, Nijmegen, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c19]Thorsten Wißmann
, Stefan Milius:
Initial Algebras Unchained - A Novel Initial Algebra Construction Formalized in Agda. LICS 2024: 72:1-72:14- [i24]Thorsten Wißmann, Stefan Milius:
Initial Algebras Unchained - A Novel Initial Algebra Construction Formalized in Agda. CoRR abs/2405.09504 (2024) - [i23]Fabian Birkmann, Stefan Milius, Henning Urbat, Thorsten Wißmann:
Algebraic Language Theory with Effects. CoRR abs/2410.12569 (2024) - 2023
- [j8]Jules Jacobs, Thorsten Wißmann:
Fast Coalgebraic Bisimilarity Minimization. Proc. ACM Program. Lang. 7(POPL): 1514-1541 (2023) - [c18]Jurriaan Rot, Thorsten Wißmann:
Bisimilar States in Uncertain Structures. CALCO 2023: 12:1-12:17 - [c17]Thorsten Wißmann:
Supported Sets - A New Foundation for Nominal Sets and Automata. CSL 2023: 38:1-38:19 - [c16]Jérémy Dubut, Thorsten Wißmann:
Weighted and Branching Bisimilarities from Generalized Open Maps. FoSSaCS 2023: 308-327 - [c15]Frits W. Vaandrager, Thorsten Wißmann:
Action Codes. ICALP 2023: 137:1-137:20 - [i22]Frits W. Vaandrager, Thorsten Wißmann:
Action Codes. CoRR abs/2301.00199 (2023) - [i21]Jérémy Dubut, Thorsten Wißmann:
Weighted and Branching Bisimilarities from Generalized Open Maps. CoRR abs/2301.07004 (2023) - [i20]Jurriaan Rot, Thorsten Wißmann:
Bisimilar States in Uncertain Structures. CoRR abs/2303.15279 (2023) - 2022
- [j7]Thorsten Wißmann:
Minimality Notions via Factorization Systems and Examples. Log. Methods Comput. Sci. 18(3) (2022) - [j6]Thorsten Wißmann, Stefan Milius, Lutz Schröder:
Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence. Log. Methods Comput. Sci. 18(4) (2022) - [c14]Joshua Moerman, Thorsten Wißmann:
State Identification and Verification with Satisfaction. A Journey from Process Algebra via Timed Automata to Model Learning 2022: 450-466 - [c13]Frits W. Vaandrager, Bharat Garhewal, Jurriaan Rot, Thorsten Wißmann:
A New Approach for Active Automata Learning Based on Apartness. TACAS (1) 2022: 223-243 - [i19]Thorsten Wißmann:
Supported Sets - A New Foundation For Nominal Sets And Automata. CoRR abs/2201.09825 (2022) - [i18]Thorsten Wißmann:
Minimality Notions via Factorization Systems and Examples. CoRR abs/2202.05701 (2022) - [i17]Thorsten Wißmann, Stefan Milius, Lutz Schröder:
Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence. CoRR abs/2203.11175 (2022) - [i16]Jules Jacobs, Thorsten Wißmann:
Coalgebraic Partition Refinement For All Functors. CoRR abs/2204.12368 (2022) - 2021
- [j5]Thorsten Wißmann, Hans-Peter Deifel, Stefan Milius, Lutz Schröder:
From generic partition refinement to weighted tree automata minimization. Formal Aspects Comput. 33(4-5): 695-727 (2021) - [c12]Thorsten Wißmann:
Minimality Notions via Factorization Systems ((Co)algebraic pearls). CALCO 2021: 24:1-24:21 - [c11]Thorsten Wißmann, Stefan Milius, Lutz Schröder:
Explaining Behavioural Inequivalence Generically in Quasilinear Time. CONCUR 2021: 32:1-32:18 - [c10]Hans-Peter Deifel, Stefan Milius, Thorsten Wißmann:
Coalgebra Encoding for Efficient Minimization. FSCD 2021: 28:1-28:19 - [i15]Hans-Peter Deifel, Stefan Milius, Thorsten Wißmann:
Coalgebra Encoding for Efficient Minimization. CoRR abs/2102.12842 (2021) - [i14]Thorsten Wißmann, Stefan Milius, Lutz Schröder:
Explaining Behavioural Inequivalence Generically in Quasilinear Time. CoRR abs/2105.00669 (2021) - [i13]Thorsten Wißmann:
Minimality Notions via Factorization Systems. CoRR abs/2106.07233 (2021) - [i12]Frits W. Vaandrager, Bharat Garhewal, Jurriaan Rot, Thorsten Wißmann:
A New Approach for Active Automata Learning Based on Apartness. CoRR abs/2107.05419 (2021) - 2020
- [b1]Thorsten Wißmann:
Coalgebraic Semantics and Minimization in Sets and Beyond. University of Erlangen-Nuremberg, Germany, 2020 - [j4]Stefan Milius, Dirk Pattinson, Thorsten Wißmann:
A new foundation for finitary corecursion and iterative algebras. Inf. Comput. 271: 104456 (2020) - [j3]Thorsten Wißmann, Ulrich Dorsch, Stefan Milius, Lutz Schröder:
Efficient and Modular Coalgebraic Partition Refinement. Log. Methods Comput. Sci. 16(1) (2020) - [i11]Thorsten Wißmann, Hans-Peter Deifel, Stefan Milius, Lutz Schröder:
From Generic Partition Refinement to Weighted Tree Automata Minimization. CoRR abs/2004.01250 (2020)
2010 – 2019
- 2019
- [c9]Hans-Peter Deifel, Stefan Milius, Lutz Schröder, Thorsten Wißmann:
Generic Partition Refinement and Weighted Tree Automata. FM 2019: 280-297 - [c8]Thorsten Wißmann, Jérémy Dubut, Shin-ya Katsumata, Ichiro Hasuo:
Path Category for Free - Open Morphisms from Coalgebras with Non-deterministic Branching. FoSSaCS 2019: 523-540 - 2018
- [j2]Harsh Beohar, Barbara König, Sebastian Küpper, Alexandra Silva, Thorsten Wißmann:
A coalgebraic treatment of conditional transition systems with upgrades. Log. Methods Comput. Sci. 14(1) (2018) - [c7]Ulrich Dorsch, Stefan Milius, Lutz Schröder, Thorsten Wißmann:
Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages. CMCS 2018: 56-77 - [i10]Stefan Milius, Dirk Pattinson, Thorsten Wißmann:
A New Foundation for Finitary Corecursion and Iterative Algebras. CoRR abs/1802.08070 (2018) - [i9]Ulrich Dorsch, Stefan Milius, Lutz Schröder, Thorsten Wißmann:
Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages. CoRR abs/1805.07211 (2018) - [i8]Thorsten Wißmann, Ulrich Dorsch, Stefan Milius, Lutz Schröder:
Efficient and Modular Coalgebraic Partition Refinement. CoRR abs/1806.05654 (2018) - [i7]Hans-Peter Deifel, Stefan Milius, Lutz Schröder, Thorsten Wißmann:
CoPaR: An Efficient Generic Partition Refiner. CoRR abs/1811.08850 (2018) - [i6]Thorsten Wißmann, Jérémy Dubut, Shin-ya Katsumata, Ichiro Hasuo:
Path category for free - Open morphisms from coalgebras with non-deterministic branching. CoRR abs/1811.12294 (2018) - 2017
- [c6]Ulrich Dorsch, Stefan Milius, Lutz Schröder, Thorsten Wißmann:
Efficient Coalgebraic Partition Refinement. CONCUR 2017: 32:1-32:16 - [c5]Lutz Schröder, Dexter Kozen, Stefan Milius, Thorsten Wißmann:
Nominal Automata with Name Binding. FoSSaCS 2017: 124-142 - [i5]Ulrich Dorsch, Stefan Milius, Lutz Schröder, Thorsten Wißmann:
A Coalgebraic Paige-Tarjan Algorithm. CoRR abs/1705.08362 (2017) - 2016
- [j1]Stefan Milius, Lutz Schröder, Thorsten Wißmann:
Regular Behaviours with Names - On Rational Fixpoints of Endofunctors on Nominal Sets. Appl. Categorical Struct. 24(5): 663-701 (2016) - [c4]Stefan Milius, Dirk Pattinson, Thorsten Wißmann:
A New Foundation for Finitary Corecursion - The Locally Finite Fixpoint and Its Properties. FoSSaCS 2016: 107-125 - [i4]Stefan Milius, Dirk Pattinson, Thorsten Wißmann:
A New Foundation for Finitary Corecursion. CoRR abs/1601.01532 (2016) - [i3]Lutz Schröder, Dexter Kozen, Stefan Milius, Thorsten Wißmann:
Nominal Automata with Name Binding. CoRR abs/1603.01455 (2016) - [i2]Stefan Milius, Lutz Schröder, Thorsten Wißmann:
Regular Behaviours with Names. CoRR abs/1607.07828 (2016) - 2015
- [c3]Stefan Milius, Thorsten Wißmann:
Finitary Corecursion for the Infinitary Lambda Calculus. CALCO 2015: 336-351 - [i1]Stefan Milius, Thorsten Wißmann:
Finitary Corecursion for the Infinitary Lambda Calculus. CoRR abs/1505.07736 (2015) - 2014
- [c2]Daniel Gorín, Dirk Pattinson, Lutz Schröder, Florian Widmann, Thorsten Wißmann:
Cool - A Generic Reasoner for Coalgebraic Hybrid Logics (System Description). IJCAR 2014: 396-402 - 2013
- [c1]Daniel Gorín, Lutz Schröder, Thorsten Wißmann:
Reasoning with Bounded Self-reference Using Logical Interpreters. Description Logics 2013: 689-703
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
