An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps-Reference-Cited by-同舟云学术

An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps

Published:2000 Issue: Volume: Page:56-73
ISSN:0302-9743
Container-title:Formal Methods in Computer-Aided Design
language:
Short-container-title:

Author:

Bloem Roderick,Gabow Harold N.,Somenzi Fabio

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-40922-X_4

Reference28 articles.

1. Lect Notes Comput Sci;R. K. Brayton,1996

2. Lect Notes Comput Sci;R. Bloem,1999

3. R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8):677–691, August 1986.

4. J. R. Büchi. On a decision method in restricted second order arithmetic. In Proceedings of the 1960 International Congress on Logic, Methodology, and Philosophy of Science, pages 1–11. Stanford University Press, 1962.

5. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite state concurrent systems using temporal logic specifications. ACM Transaction on Programming Languages and Systems, 8(2):244–263, 1986.

Cited by 31 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Computing Bottom SCCs Symbolically Using Transition Guided Reduction;Computer Aided Verification;2021

2. Symbolic Coloured SCC Decomposition;Tools and Algorithms for the Construction and Analysis of Systems;2021

3. Spanning the spectrum from safety to liveness;Acta Informatica;2017-10-23

4. Compositional Synthesis of Reactive Controllers for Multi-agent Systems;Computer Aided Verification;2016

5. Synthesizing efficient systems in probabilistic environments;Acta Informatica;2015-05-13