no code implementations • 5 Jul 2020 • Yong Li, Andrea Turrini, Xuechao Sun, Lijun Zhang
While this is well-understood in the termination analysis of programs, this is not the case for the language inclusion analysis of B\"uchi automata, where research mainly focused on improving algorithms for proving language inclusion, with the search for counterexamples left to the expensive complementation operation.
