scientific article; zbMATH DE number 1979545

MaRDI QIDQ4427897zbMATH OpenFDO

Authors Fabio Somenzi, Kavita Ravi, Roderick Bloem

Publication date 14 September 2003

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

• scientific article; zbMATH DE number 1705167
• scientific article; zbMATH DE number 1982197
• An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
• scientific article; zbMATH DE number 2079387
• scientific article; zbMATH DE number 1487478

Cited in

(8)

• Compositional SCC analysis for language emptiness
• scientific article; zbMATH DE number 1705167 (Why is no real title available?)
• scientific article; zbMATH DE number 1982197 (Why is no real title available?)
• Lower bounds for symbolic computation on graphs: strongly connected components, liveness, safety, and diameter
• scientific article; zbMATH DE number 1863179 (Why is no real title available?)
• 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:

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