We focus on three SCC algorithms which we shall refer to as Tarjan [19], Dijkstra [6], Gabow [8]. Tarjan is the most well-known algorithm to compute SCC and it has been extended by Geldenhuys and Valmari [11] to check the emptiness of (non-generalized) Büchi automata.
Abstract. The automata-theoretic approach for the verification of linear time properties involves checking the emptiness of a Büchi automaton. However ...
This leads us to define two new emptiness check algorithms (one of them based on the Union Find data structure), introduce new optimizations, and show that one ...
This Talk! Is there a best explicit SCC computation algorithm? How to transform SCCs computation algorithms into generalized emptiness checks?
Abstract. The automata-theoretic approach for the verification of lin- ear time properties involves checking the emptiness of a Büchi automa-.
The automata-theoretic approach for the verification of linear time properties involves checking the emptiness of a Buchi automaton, however generalized ...
Nov 21, 2024 · The automata-theoretic approach for the verification of linear time properties involves checking the emptiness of a Büchi automaton.
Three SCC-Based Emptiness Checks for Generalized Büchi Automata. E. Renault, A. Duret-Lutz, F. Kordon, and D. Poitrenaud. LPAR, volume 8312 of Lecture Notes ...
Unlike existing parallel emptiness checks, these are based on a Strongly Connected Component (SCC) enumeration, support generalized Büchi acceptance, and ...
Missing: Three | Show results with:Three
The best rank-based algorithm for Büchi universality, by Doyen and Raskin, employs a subsumption technique to minimize the size of the working set. Separately, ...