Exponential space complexity for OBDD-based reachability analysis-Reference-Cited by-同舟云学术

Exponential space complexity for OBDD-based reachability analysis

Published:2010-10 Issue:21 Volume:110 Page:924-927
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Bollig Beate

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference16 articles.

1. Graph-based algorithms for Boolean function manipulation;Bryant;IEEE Transactions on Computers,1986

2. J.R. Burch, E.M. Clarke, D.E. Long, K.L. McMillan, D.L. Dill, L.J. Hwang, Symbolic model checking: 1020 states and beyond, in: Proc. of Symposium on Logic in Computer Science, 1990, pp. 428–439.

3. Verification of synchronous sequential machines based on symbolic execution;Coudert,1989

4. Complexity of problems on graphs represented as OBDDs;Feigenbaum,1998

5. Computing strongly connected components in a linear number of symbolic steps;Gentilini,2003

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

1. Solid state ionics – Selected topics and new directions;Progress in Materials Science;2022-05

2. Decision and optimization problems in the unreliable-circuit logic;Logic Journal of the IGPL;2017-04-01

3. Implicit computation of maximum bipartite matchings by sublinear functional operations;Theoretical Computer Science;2014-12

4. On efficient implicit OBDD-based algorithms for maximal matchings;Information and Computation;2014-12

5. Approximate reasoning about logic circuits with single-fan-out unreliable gates;Journal of Logic and Computation;2013-08-14