An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps (Q2505621)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps |
scientific article |
Statements
An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps (English)
0 references
28 September 2006
0 references
symbolic algorithms
0 references
strongly connected components
0 references
binary decision diagrams
0 references
language emptiness
0 references
Büchi automata
0 references
Streett automata
0 references
model checking
0 references
depth-first search
0 references
breadth-first search
0 references
0 references
