Is there a best symbolic cycle-detection algorithm?
From MaRDI portal
Recommendations
Cited in
(18)- Improved lower bounds for the cycle detection problem
- Symbolic synthesis of masking fault-tolerant distributed programs
- On algorithmic analysis of transcriptional regulation by LTL model checking
- GSTE is partitioned model checking
- Cycle detection using a stack
- Compositional SCC analysis for language emptiness
- From complementation to certification
- Improved distributed algorithms for SCC decomposition
- Parallel model checking large-scale genetic regulatory networks with DiVinE
- scientific article; zbMATH DE number 1982197 (Why is no real title available?)
- scientific article; zbMATH DE number 1979545 (Why is no real title available?)
- Linear temporal logic symbolic model checking
- scientific article; zbMATH DE number 2102721 (Why is no real title available?)
- Automata-Theoretic Model Checking Revisited
- Revisiting Resistance Speeds Up I/O-Efficient LTL Model Checking
- A new heuristic for bad cycle detection using BDDs
- Towards a grand unification of Büchi complementation constructions
- A truly symbolic linear-time algorithm for SCC decomposition
This page was built for publication: Is there a best symbolic cycle-detection algorithm?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2771062)