Skip to main content
Log in

Minimizing Place Capacities of Weighted Event Graphs for Enforcing Liveness

  • Published:
Discrete Event Dynamic Systems Aims and scope Submit manuscript

Abstract

This paper addresses the problem of minimizing place capacities of weighted event graphs in order to enforce liveness. Necessary and sufficient conditions of the solution existence are derived. Lower bounds of place capacities while preserving liveness are established and a polynomial algorithm is proposed to determine an initial marking leading to these lower bounds while preserving the liveness.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Adé M (1997) Data memory minimization for synchronous data flow graphs emulated on dsp-fpga targets. PhD Thesis, Université Catholique de Louvain

  • Adé M, Lauwereins R, Peperstraete JA (1994) Buffer memory requirements in dsp applications. In: IEEE 5th international workshop on rapid system prototyping. Grenoble, France, pp 108–123

  • Bhattacharyya SS, Murthy PK, Lee EA (1999) Synthesis of embedded software from synchronous dataflow specifications. J VLSI Signal Process (21):151–166

  • Čubrić M, Panangaden P (1993) Minimal memory schedules for dataflow networks. In: CONCUR ’93, 4th international conference on concurrency theory. Lecture notes in computer science, vol 715, pp 368–383

  • Chrzastowski-Wachtel P, Raczunas M (1993) Liveness of weighted circuits and the diophantine problem of Frobenius. FCT, pp 171–180

  • Gaubert S (1990) An algebraic method for optimizing resources in timed event graphs. In: 9th Conference on analysis and optimization of systems. Lecture notes in computer science, vol 144, pp 957–966

  • Giua A, Piccaluga A, Seatzu C (2002) Firing rate optimization of cyclic timed event graphs. Automatica 38(1):91–103

    Article  MATH  MathSciNet  Google Scholar 

  • Hillion H, Proth J-M (1989) Performance evaluation of a job-shop system using timed event graph. IEEE Trans Automat Contr 34(1):3–9

    Article  MATH  MathSciNet  Google Scholar 

  • Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum, pp 85–103

  • Karp RM, Miller RE (1966) Properties of a model for parallel computations: determinacy, termination, queueing. SIAM 14(63):1390–1411

    MATH  MathSciNet  Google Scholar 

  • Lee EA, Messerschmitt DG (1987a) Static scheduling of synchronous data flow programs for digital signal processing. IEEE Trans Comput C-36(1):24–35

    Google Scholar 

  • Lee EA, Messerschmitt DG (1987b) Synchronous data flow. IEEE Proc IEEE 75(9):1235–1245

    Article  Google Scholar 

  • Laftit S, Proth J-M, Xie X (1992) Optimization of invariant criteria for event graphs. IEEE Trans Automat Contr 37(5):547–555

    Article  MATH  MathSciNet  Google Scholar 

  • Murthy PK, Bhattacharyya SS, Lee EA (1997) Joint minimization of code and data for synchonous dataflow programs. J Formal Methods Syst Des 11(1):41–70

    Article  Google Scholar 

  • Marchetti O, Munier-Kordon A (2004) A sufficient condition for the liveness of weighted event graphs. Research report, LIP6, Laboratoire d’Informatique de Paris 6. Available at ftp://asim.lip6.fr/pub/reports/2004/rp.lip6.2004.marchetti.pdf

  • Munier A (1993) Régime asymptotique optimal d’un graphe d’événements temporisé: application à un probléme d’assemblage. RAIRO 27(5):171–180

    Google Scholar 

  • Munier A (1996) The basic cyclic scheduling problem with linear precedence constraints. Discret Appl Math 64(3):219–238

    Article  MATH  MathSciNet  Google Scholar 

  • Murthy PM (1996) Scheduling techniques for synchronous and multidimensional synchronous dataflow. PhD Thesis, University of California at Berkeley

  • Sauer N (2003) Marking optimization of weighted marked graphs. Discret Event Dyn Syst 13(3):245–262

    Article  MATH  MathSciNet  Google Scholar 

  • Teruel E, Chrzastowski P, Colom JM, Silva M (1992) On weighted T-Systems. In: Jensen K (ed) Application and theory of Petri nets, vol 616. Springer, pp 348–367

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Olivier Marchetti.

Additional information

This research was partially supported by a partnership Cnrs-STMicroelectronics.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Marchetti, O., Munier-Kordon, A. Minimizing Place Capacities of Weighted Event Graphs for Enforcing Liveness. Discrete Event Dyn Syst 18, 91–109 (2008). https://doi.org/10.1007/s10626-007-0035-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10626-007-0035-y

Keywords

Navigation