Size measures and alphabetic equivalence in the μ-calculus
Clemens Kupke, Johannes Marti, Yde Venema · 2022
Algorithms for solving computational problems related to the modal μ-calculus generally do not take the formulas themselves as input, but operate on some kind of representation of formulas. This representation is usually based on a graph structure that one may associate with a μ-calculus formula. Recent work by Kupke, Marti & Venema showed that the operation of renaming bound variables may incur an exponential blow-up of the size of such a graph representation. Their example revealed the undesirable situation that standard constructions, on which algorithms for model checking and satisfiability depend, are sensitive to the specific choice of bound variables used in a formula.