Efficient reduction of nondeterministic automata with application to language inclusion testing

by   Lorenzo Clemente, et al.

We present efficient algorithms to reduce the size of nondeterministic Büchi word automata (NBA) and nondeterministic finite word automata (NFA), while retaining their languages. Additionally, we describe methods to solve PSPACE-complete automata problems like language universality, equivalence, and inclusion for much larger instances than was previously possible (> 1000 states instead of 10-100). This can be used to scale up applications of automata in formal verification tools and decision procedures for logical theories. The algorithms are based on new techniques for removing transitions (pruning) and adding transitions (saturation), as well as extensions of classic quotienting of the state space. These techniques use criteria based on combinations of backward and forward trace inclusions and simulation relations. Since trace inclusion relations are themselves PSPACE-complete, we introduce lookahead simulations as good polynomial time computable approximations thereof. Extensive experiments show that the average-case time complexity of our algorithms scales slightly above quadratically. (The space complexity is worst-case quadratic.) The size reduction of the automata depends very much on the class of instances, but our algorithm consistently reduces the size far more than all previous techniques. We tested our algorithms on NBA derived from LTL-formulae, NBA derived from mutual exclusion protocols and many classes of random NBA and NFA, and compared their performance to the well-known automata tool GOAL.


Minimization and Canonization of GFG Transition-Based Automata

While many applications of automata in formal methods can use nondetermi...

Zone-based verification of timed automata: extrapolations, simulations and what next?

Timed automata have been introduced by Rajeev Alur and David Dill in the...

Simulations in Rank-Based Büchi Automata Complementation

The long search for an optimal complementation construction for Büchi au...

Random Wheeler Automata

Wheeler automata were introduced in 2017 as a tool to generalize existin...

Proving Non-Inclusion of Büchi Automata based on Monte Carlo Sampling

The search for a proof of correctness and the search for counterexamples...

Algorithms for Acyclic Weighted Finite-State Automata with Failure Arcs

Weighted finite-state automata (WSFAs) are commonly used in NLP. Failure...

Efficient methods to determine the reversibility of general 1D linear cellular automata in polynomial complexity

In this paper, we study reversibility of one-dimensional(1D) linear cell...

Please sign up or login with your details

Forgot password? Click here to reset