1 citations · 1 across the 13 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.LO2022
Coalgebraic Satisfiability Checking for Arithmetic -Calculi
Daniel Hausmann, Lutz Schröder
The coalgebraic -calculus provides a generic semantic framework for fixpoint logics over systems whose branching type goes beyond the standard relational setup, e.g. probabilist…
cs.LO2022
A Survey on Satisfiability Checking for the -Calculus through Tree Automata
Daniel Hausmann, Nir Piterman
Algorithms for model checking and satisfiability of the modal -calculus start by converting formulas to alternating parity tree automata. Thus, model checking is reduced to chec…