59 citations · 185 across the 53 of their papers we have counts for
9 papers · 1 filter
Trichotomic Argumentation Representation
Merlin Göttlinger, Lutz Schröder
The Aristotelian trichotomy distinguishes three aspects of argumentation: Logos, Ethos, and Pathos. Even rich argumentation representations like the Argument Interchange Format (AI…
Graded Monads and Graded Logics for the Linear Time -- Branching Time Spectrum
Ulrich Dorsch, Stefan Milius, Lutz Schröder
State-based models of concurrent systems are traditionally considered under a variety of notions of process equivalence. In the particular case of labelled transition systems, thes…
Generic Partition Refinement and Weighted Tree Automata
Hans-Peter Deifel, Stefan Milius, Lutz Schröder +1
Partition refinement is a method for minimizing automata and transition systems of various types. Recently, we have developed a partition refinement algorithm that is generic in th…
A van Benthem Theorem for Quantitative Probabilistic Modal Logic
Paul Wild, Lutz Schröder, Dirk Pattinson +1
In probabilistic transition systems, behavioural metrics provide a more fine-grained and stable measure of system equivalence than crisp notions of bisimilarity. They correlate str…
A Metalanguage for Guarded Iteration
Sergey Goncharov, Christoph Rauch, Lutz Schröder
Notions of guardedness serve to delineate admissible recursive definitions in various settings in a compositional manner. In recent work, we have introduced an axiomatic notion of…
Efficient and Modular Coalgebraic Partition Refinement
Thorsten Wißmann, Ulrich Dorsch, Stefan Milius +1
We present a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in system analysis and verification. Coalgebrai…