Implement the algorithm of Symbolic Model Checking, McMillan 1993, section 2.4.
Supports the operators :
- unarry : `EX, EF, EG, AX, AF, AG`
- unary : `EX, EF, EG, AX, AF, AG`
- binary : `EU, EW, ER, AU, AW, AR`
### Fair CTL
Implement the algorithm of Symbolic Model Checking, McMillan 1993, section 6.4 and Symbolic model checking: 1020 states and beyond, Burch et al 1992, section 6.2.
The evaluation of the formula is restricter to the trajectoriers verifying fairness constraints of the form `AND([GF f for f in fairness])`.
An additional argument must be given at initialization, representing the fairness constraints :
- a list of strings, Phi objects or sdd, representing the list of fairness constraints : [f1, f2,...]
- a single string, Phi or sdd, representing a single fairness constraint