59 citations · 185 across the 53 of their papers we have counts for
66 papers
Graded Semantics of Nominal Systems
Hannes Schulze, Lutz Schröder, Üsame Cengiz
Nominal automata models and transition systems serve as formalisms for languages and processes carrying data, and as such relate closely to classical register-based models. The par…
Alternating Nominal Automata with Name Allocation
Florian Frank, Daniel Hausmann, Stefan Milius +2
Formal languages over infinite alphabets serve as abstractions of structures and processes carrying data. Automata models over infinite alphabets, such as classical register automa…
Nominal Tree Automata With Name Allocation
Simon Prucker, Lutz Schröder
Data trees serve as an abstraction of structured data, such as XML documents. A number of specification formalisms for languages of data trees have been developed, many of them adh…
Generic Model Checking for Modal Fixpoint Logics in COOL-MC
Daniel Hausmann, Merlin Humml, Simon Prucker +2
We report on COOL-MC, a model checking tool for fixpoint logics that is parametric in the branching type of models (nondeterministic, game-based, probabilistic etc.) and in the nex…
Expressive Quantale-valued Logics for Coalgebras: an Adjunction-based Approach
Harsh Beohar, Sebastian Gurke, Barbara König +4
We address the task of deriving fixpoint equations from modal logics characterizing behavioural equivalences and metrics (summarized under the term conformances). We rely on earlie…
Graded Semantics and Graded Logics for Eilenberg-Moore Coalgebras
Jonas Forster, Lutz Schröder, Paul Wild +3
Coalgebra, as the abstract study of state-based systems, comes naturally equipped with a notion of behavioural equivalence that identifies states exhibiting the same behaviour. In…