A truly symbolic linear-time algorithm for SCC decomposition
From MaRDI portal
Publication:6536142
DOI10.1007/978-3-031-30820-8_22zbMATH Open1547.68621MaRDI QIDQ6536142FDOQ6536142
Authors: Casper Abild Larsen, Simon Meldahl Schmidt, Jesper Steensgaard, Anna Blume Jakobsen, Jaco van de Pol, Andreas Pavlogiannis 
Publication date: 5 April 2024
Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Nonnumerical algorithms (68W05) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Distributed algorithms for SCC decomposition
- Title not available (Why is that?)
- Depth-First Search and Linear Graph Algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- A strong-connectivity algorithm and its applications in data flow analysis
- An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
- Title not available (Why is that?)
- Tools and Algorithms for the Construction and Analysis of Systems
- Title not available (Why is that?)
- A new heuristic for bad cycle detection using BDDs
- Title not available (Why is that?)
- A CTL* Model Checker for Petri Nets
- Title not available (Why is that?)
- Computing bottom SCCs symbolically using transition guided reduction
- Model checking with strong fairness
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: A truly symbolic linear-time algorithm for SCC decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536142)
