Analysis of symbolic SCC hull algorithms

DOI10.1007/3-540-36126-X_6MaRDI QIDQ4427897zbMATH OpenFDO

Authors Fabio Somenzi, Kavita Ravi, Roderick Bloem

Publication date 14 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2517/25170088.htm

Mathematics Subject Classification ID

Computer science aspects of computer-aided design (68U07)

Recommendations

• Is there a best symbolic cycle-detection algorithm?
• Distributed explicit fair cycle detection (set based approach)
• An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
• scientific article; zbMATH DE number 2079387
• Symbolic model checking with fewer fixpoint computations

Cited in

(8)

• Compositional SCC analysis for language emptiness
• Is there a best symbolic cycle-detection algorithm?
• Distributed explicit fair cycle detection (set based approach)
• Lower bounds for symbolic computation on graphs: strongly connected components, liveness, safety, and diameter
• Divide and compose: SCC refinement for language emptiness
• Component-wise incremental LTL model checking
• Automata-Theoretic Model Checking Revisited
• Computing bottom SCCs symbolically using transition guided reduction

This page was built for publication: Analysis of symbolic SCC hull algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4427897)