4. The method of claim 3 wherein composing the symbolic finite automaton and at least one other symbolic finite automaton into a composed symbolic finite automaton comprises performing a product of symbolic finite automata, including checking satisfiability.
3. The method of claim 1 further comprising, composing the symbolic finite automaton and at least one other symbolic finite automaton into a composed symbolic finite automaton.