Liveness and boundedness of synchronous data flow graphs

Proceedings of Formal Methods in Computer Aided Design, FMCAD 2006

Volumn , Issue , 2006, Pages 68-75

  Ghamarian, A H ^a   Geilen, M C W ^a   Basten, T ^a   Theelen, B D ^a   Mousavi, M R ^a   Stuijk, S ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDEDNESS; SELF-TIMED BOUNDEDNESS; STREAMING APPLICATIONS; SYNCHRONOUS DATA FLOW GRAPHS (SDFG);

ALGORITHMS; DATA REDUCTION; MATHEMATICAL MODELS; THROUGHPUT;

DATA FLOW ANALYSIS;

EID: 34547406810     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FMCAD.2006.20     Document Type: Conference Paper

References (20)

1. F. Baccelli, G. Cohen, G. Olsder, and J.-P. Quadrat. Synchronization and linearity: an algebra for discrete event systems. Wiley, 1992.
2. B. Berthomieu and M. Diaz. Modeling and verification of time dependent systems using time Petri nets. IEEE Transactions on Software Engineering, 17(3):259-273, 1991.
3. S. Bhattacharyya, P. Murthy, and E. Lee. Synthesis of embedded software from synchronous dataflow specifications. Journal on VLSI Signal Process. Syst., 21(2): 151-166, 1999.
4. F. D. Bowden. A brief survey and synthesis of the roles of time in Petri nets. Mathematical and Computer Modelling, 31(10):55-68, 2000.
5. T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2001.
6. A. Dasdan. Experimental analysis of the fastest optimum cycle ratio and mean algorithms. ACM Trans. on Design Automation of Electronic Systems, 9(4):385-418, 2004.
7. J. Esparza. Decidability and complexity of Petri net problems - an introduction. In W. Reisig and G. Rozenberg, editors, Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, volume 1491 of Lecture Notes in Computer Science, pages 374-428. Springer-Verlag, 1998.
8. A. H. Ghamarian, M. Geilen, S. Stuijk, T. Basten, A. Moonen, M. Bekooij, B. Theelen, and M. Mousavi. Throughput analysis of synchronous data flow graphs. In ACSD, Proc., pages 25-34. IEEE, 2006.
9. A. H. Ghamarian, M. C. W. Geilen, T. Basten, B. Theelen, M. M. R., and S. Stuijk. Liveness and boundedness of synchronous data flow graphs. Tech. report ESR-2006-04, TU Eindhoven, http://www.es.ele.tue.nl/esreports/, 2006.
10. N. D. Jones, L. H. Landweber, and Y. E. Lien. Complexity of some problems in Petri nets. Theoretical Computer Science, 4(3):277-299, 1977.
11. R. M. Karp and R. E. Miller. Properties of a model for parallel computations: Determinacy, termination, queueing. SIAM Journal on Applied Mathematics, 14(6): 1390-1411, 1966.
12. E. Lee. A coupled hardware and software architecture for programmable digiral signal processors. PhD thesis, University of California, Berkeley, 1986.
13. E. Lee and D. Messerschmitt. Synchronous dataflow. Proceedings of the IEEE, 75(9): 1235-1245, September 1987.
14. P. M. Merlin. A Study of Recoverability of Processes. PhD thesis, Department of Information and Computer Science, University of California at Irvine, 1975.
15. T. Murata. Petri nets: Properties, analysis and applications. Proceedings of the IEEE, 77(4):541-580, 1989.
16. T. M. Parks. Bounded Scheduling for Process Networks. PhD thesis, 1995.
17. P. Poplavko, T. Basten, M. Bekooij, J. van Meerbergen, and B. Mesman. Task-level timing models for guaranteed performance in multiprocessor networks-on-chip. In CASES, Proc., pages 63-72. ACM, 2003.
18. L. Popova-Zeugmann. On liveness and boundedness in time Petri nets. In Proceedings of the Workshop on Concurrency, Specification and Programming (CS&P'95), pages 136-145, 1995.
19. S. Sriram and S. Bhattacharyya. Embedded Multiprocessors: Scheduling and Synchronization. Marcel Dekker, Inc, New York, NY, USA, 2000.
20. E. Teruel, P. Chrzastowski, J. M. Colom, and M. Silva. On weighted T-systems. In Jensen, K., editor, 13th International Conference on Application and Theory of Petri Nets 1992, Sheffield, UK, volume 616 of Lecture Notes in Computer Science, pages 348-367. Springer-Verlag, 1992.