Models For Dependable Computation with Multiple Inputs and Some Hardness Results

@article{Wang2000ModelsFD,
  title={Models For Dependable Computation with Multiple Inputs and Some Hardness Results},
  author={Yongge Wang and Yvo Desmedt and Mike Burmester},
  journal={Fundam. Inform.},
  year={2000},
  volume={42},
  pages={61-73}
}
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR graphs to model fault tolerant computations with multiple inputs. While there is a polynomial time algorithm for finding vertex disjoint paths in networks, we will show that the equivalent problem in computation systems with multiple inputs is NP-hard. Our main results are as follows. (1) We present a general model for… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Paths, Flows, and VLSI Layout

  • B. Korte, L. Lovasz, H. Pr omel, A Schrijver
  • 1990
Highly Influential
3 Excerpts

Flows in Networks

  • L. Ford, D Fulkerson
  • 1962
Highly Influential
3 Excerpts

Intelligent agents

  • D. Riecken
  • Commun. of the ACM,
  • 1994
1 Excerpt