Liveness and Boundedness of Synchronous Data Flow Graphs

@article{Ghamarian2006LivenessAB,
  title={Liveness and Boundedness of Synchronous Data Flow Graphs},
  author={Amir Hossein Ghamarian and Marc Geilen and Twan Basten and Bart D. Theelen and Mohammad Reza Mousavi and Sander Stuijk},
  journal={2006 Formal Methods in Computer Aided Design},
  year={2006},
  pages={68-75}
}
Synchronous data flow graphs (SDFGs) have proven to be suitable for specifying and analyzing streaming applications that run on single- or multi-processor platforms. Streaming applications essentially continue their execution indefinitely. Therefore, one of the key properties of an SDFG is liveness, i.e., whether all parts of the SDFG can run infinitely often. Another elementary requirement is whether an implementation of an SDFG is feasible using a limited amount of memory. In this paper, we… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 48 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 20 REFERENCES

Liveness and boundedness of synchronous data flow graphs

  • A. H. Ghamarian, M.C.W. Geilen, T. Basten, M.M.R.B. Theelen, S. Stuijk
  • Tech. report ESR--04,
  • 2006
1 Excerpt

Similar Papers

Loading similar papers…