activity
20162026
most citedGeneric Model Checking for Modal Fixpoint Logics in COOL-MC

1 citations · 1 across the 4 of their papers we have counts for

collaborators
Showing 2022Show all

1 paper · 1 filter

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…