An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps

@article{Bloem2000AnAF,
  title={An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps},
  author={Roderick Bloem and Harold N. Gabow and F. Somenzi},
  journal={Formal Methods in System Design},
  year={2000},
  volume={28},
  pages={37-56}
}
We present a symbolic algorithm for strongly connected component decomposition. The algorithm performs Θ(n log n) image and preimage computations in the worst case, where n is the number of nodes in the graph. This is an improvement over the previously known quadratic bound. The algorithm can be used to decide emptiness of Büchi automata with the same complexity bound, improving Emerson and Lei's quadratic bound, and emptiness of Streett automata, with a similar bound in terms of nodes. It also… 
Computing strongly connected components in a linear number of symbolic steps
TLDR
An algorithm that computes in a linear number of symbolic steps the strongly connected components of a graph represented by an Ordered Binary Decision Diagram (OBDD) matches the complexity of Tarjan's algorithm operating on explicit data structures.
Biconnectivity on Symbolically Represented Graphs: A Linear Solution
TLDR
The approach suggests a symbolic framework to tackle those problems which are naturally solved by a DFS-based algorithm in the standard case, and the use of spine-sets, introduced in [8] for strongly connected components, as its substitute.
Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter
TLDR
Lower bounds on the number of symbolic operations are given for basic graph problems such as the computation of the strongly connected components and of the approximate diameter as well as for fundamental problems in model checking such as safety, liveness, and co-liveness.
Antichains for the Automata-Based Approach to Model-Checking
TLDR
The existence of simulation pre-orders that can be exploited to efficiently evaluate fixed points on the automata defined during the complementation step are established and the performance of the algorithm to check the universality of Buchi automata is evaluated using the random automaton model recently proposed by Tabakov and Vardi.
Symbolic Graphs: Linear Solutions to Connectivity Related Problems
TLDR
A symbolic algorithmic strategy, based on the new notion of spine-set, that is general enough to be the engine of linear symbolic step algorithms for both strongly connected components and biconnected components is devised.
On the Complexity of Parity Word Automata
TLDR
It is shown that the special structure of the acceptance condition of parity automata can be used in order to solve the nonemptiness problem directly, with a dynamic graph algorithm of complexity O((n + m) log k).
Analysis of Symbolic SCC Hull Algorithms
TLDR
An early termination check is proposed that allows the Lockstep algorithm to detect the existence of a fair cycle before an entire SCC has been examined and has optimal complexity among those that can be derived from GSH.
Finding strongly connected components in parallel using O(log2n) reachability queries
TLDR
A randomized (Las-Vegas) parallel algorithm for computing strongly connected components of a graph with n vertices and m edges that improves the number of processors needed to compute stronglyconnected components and topological sort within time.
A Comparative Study of Symbolic Algorithms for the Computation of Fair Cycles
TLDR
A taxonomy of techniques for fair cycle detection is presented and it is indicated that the Emerson-Lei procedure is the fastest, but other algorithms tend to generate shorter counter-examples.
A Symbolic Approach to the All-Pairs Shortest-Paths Problem
TLDR
This paper presents a symbolic algorithm for the all-pairs shortest-paths (APSP) problem in loopless directed graphs with strictly positive integral edge weights and proves that runtime and space usage are polylogarithmic w.
...
...

References

SHOWING 1-10 OF 35 REFERENCES
Implicit enumeration of strongly connected components and anapplication to formal verification
  • A. XieP. Beerel
  • Computer Science
    IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
  • 2000
TLDR
Experimental results suggest that the algorithm dramatically outperforms the only existing implicit method which must compute the transitive closure of the adjacency-matrix of the graphs and applies it to solve the bad cycle detection problem encountered in formal verification.
Graph-Based Algorithms for Boolean Function Manipulation
  • R. Bryant
  • Computer Science
    IEEE Transactions on Computers
  • 1986
TLDR
Experimental results from applying a new data structure for representing Boolean functions and an associated set of manipulation algorithms to problems in logic design verification demonstrate the practicality of this approach.
Efficient omega-Regular Language Containment
TLDR
A few generalpurpose operators on graphs are introduced and used to construct efficient algorithms for the product machine of the system and specification and fast special checks are applied to find bad cycles early on.
Depth-First Search and Linear Graph Algorithms
The value of depth-first search or “backtracking” as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components
A Comparative Study of Symbolic Algorithms for the Computation of Fair Cycles
TLDR
A taxonomy of techniques for fair cycle detection is presented and it is indicated that the Emerson-Lei procedure is the fastest, but other algorithms tend to generate shorter counter-examples.
Implicit enumeration of strongly connected components
  • A. XieP. Beerel
  • Computer Science
    1999 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (Cat. No.99CH37051)
  • 1999
TLDR
This paper presents a binary decision diagram (BDD) based implicit algorithm to compute all maximal strongly connected components (SCCs) of directed graphs that dramatically outperforms the only existing implicit method which must compute the transitive closure of the adjacency matrix of the graphs.
Testing Language Containment for omega-Automata Using BDD's
TLDR
Two new BDD-based language containment checks in COSPAN are implemented, one with a time advantage and the other with a space advantage, which have increased significantly the size of system models which can be verified.
Propositional Dynamic Logic of Looping and Converse Is Elementarily Decidable
An On-Line Edge-Deletion Problem
TLDR
An algorithm is presented which maintains a data structure in which each question is answered in constant time and for which the total time involved in answering q questions and maintaining the data structure is O(q + I VI) lED.
A Unified Approach to Language Containment and Fair CTL Model Checking
TLDR
This paper argues that MC and LC are to some extent complementary, and presents an MC algorithm for Fair CTL, an extension of CTL capable of handling fairness constraints, which uses algorithms for LC as a subroutine.
...
...