Now showing items 1-1 of 1

    • Evaluating Performance of Automaton University Checking Algorithms 

      Fisher, Corey Scott (2019-03-28)
      NFA universality is an important problem in formal verification, since it is an effective proxy for complementation of NFAs - a key operation that underlies most verification algorithms. However, because complemented automata are extremely large, many modern tools use symbolic representations to perform complementation and universality checking. One ...