The tool below can be used to solve parity games by Zielonka's algorithm. For the specified parity game, it computes the winning states of both players as well as their strategies, and shows how these were computed by Zielonka's algorithm.
The syntax for the state transition systems (the Kripke structures) should be obvious: states are integers 0,...,n as listed for both players. The ranks of the states are given as declarations in the rank section where state s is given rank r by writing s:r. Finally, transitions are given in the form i->j denoting a transition from state i to state j.
The tool below can be used to synthesize a Moore automaton (if possible) that will select output values in each state such that a given safety/liveness/persistence/fairness property is achieved. Note that the given omega-automaton has to be deterministic in the sense that every states has for every pair (i,o) of an input and an output exactly one transition.
The tool below can be used to find a most general unifier for two boolean functions that is computed by boolean unification. This means, it computes, if possible, a substitution of the variables by boolean functions such that the two given boolean functions become the same.