{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,10]],"date-time":"2024-08-10T02:19:20Z","timestamp":1723256360886},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,1,5]],"date-time":"2008-01-05T00:00:00Z","timestamp":1199491200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Event Dyn Syst"],"published-print":{"date-parts":[[2008,3]]},"DOI":"10.1007\/s10626-007-0035-y","type":"journal-article","created":{"date-parts":[[2008,1,4]],"date-time":"2008-01-04T09:20:40Z","timestamp":1199438440000},"page":"91-109","source":"Crossref","is-referenced-by-count":7,"title":["Minimizing Place Capacities of Weighted Event Graphs for Enforcing Liveness"],"prefix":"10.1007","volume":"18","author":[{"given":"Olivier","family":"Marchetti","sequence":"first","affiliation":[]},{"given":"Alix","family":"Munier-Kordon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,1,5]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Ad\u00e9 M (1997) Data memory minimization for synchronous data flow graphs emulated on dsp-fpga targets. PhD Thesis, Universit\u00e9 Catholique de Louvain","DOI":"10.1145\/266021.266036"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Ad\u00e9 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\u2013123","DOI":"10.1109\/IWRSP.1994.315904"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Bhattacharyya SS, Murthy PK, Lee EA (1999) Synthesis of embedded software from synchronous dataflow specifications. J VLSI Signal Process (21):151\u2013166","DOI":"10.1023\/A:1008052406396"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"\u010cubri\u0107 M, Panangaden P (1993) Minimal memory schedules for dataflow networks. In: CONCUR \u201993, 4th international conference on concurrency theory. Lecture notes in computer science, vol\u00a0715, pp 368\u2013383","DOI":"10.1007\/3-540-57208-2_26"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Chrzastowski-Wachtel P, Raczunas M (1993) Liveness of weighted circuits and the diophantine problem of Frobenius. FCT, pp 171\u2013180","DOI":"10.1007\/3-540-57163-9_13"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"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\u00a0957\u2013966","DOI":"10.1007\/BFb0120116"},{"issue":"1","key":"35_CR7","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0005-1098(01)00189-3","volume":"38","author":"A Giua","year":"2002","unstructured":"Giua A, Piccaluga A, Seatzu C (2002) Firing rate optimization of cyclic timed event graphs. Automatica 38(1):91\u2013103","journal-title":"Automatica"},{"issue":"1","key":"35_CR8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/9.8644","volume":"34","author":"H Hillion","year":"1989","unstructured":"Hillion H, Proth J-M (1989) Performance evaluation of a job-shop system using timed event graph. IEEE Trans Automat Contr 34(1):3\u20139","journal-title":"IEEE Trans Automat Contr"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum, pp 85\u2013103","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"63","key":"35_CR10","first-page":"1390","volume":"14","author":"RM Karp","year":"1966","unstructured":"Karp RM, Miller RE (1966) Properties of a model for parallel computations: determinacy, termination, queueing. SIAM 14(63):1390\u20131411","journal-title":"SIAM"},{"issue":"1","key":"35_CR11","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/TC.1987.5009446","volume":"C-36","author":"EA Lee","year":"1987a","unstructured":"Lee EA, Messerschmitt DG (1987a) Static scheduling of synchronous data flow programs for digital signal processing. IEEE Trans Comput C-36(1):24\u201335","journal-title":"IEEE Trans Comput"},{"issue":"9","key":"35_CR12","doi-asserted-by":"crossref","first-page":"1235","DOI":"10.1109\/PROC.1987.13876","volume":"75","author":"EA Lee","year":"1987b","unstructured":"Lee EA, Messerschmitt DG (1987b) Synchronous data flow. IEEE Proc IEEE 75(9):1235\u20131245","journal-title":"IEEE Proc IEEE"},{"issue":"5","key":"35_CR13","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1109\/9.135488","volume":"37","author":"S Laftit","year":"1992","unstructured":"Laftit S, Proth J-M, Xie X (1992) Optimization of invariant criteria for event graphs. IEEE Trans Automat Contr 37(5):547\u2013555","journal-title":"IEEE Trans Automat Contr"},{"issue":"1","key":"35_CR14","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1023\/A:1008633809454","volume":"11","author":"PK Murthy","year":"1997","unstructured":"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\u201370","journal-title":"J Formal Methods Syst Des"},{"key":"35_CR15","unstructured":"Marchetti O, Munier-Kordon A (2004) A sufficient condition for the liveness of weighted event graphs. Research report, LIP6, Laboratoire d\u2019Informatique de Paris 6. Available at ftp:\/\/asim.lip6.fr\/pub\/reports\/2004\/rp.lip6.2004.marchetti.pdf"},{"issue":"5","key":"35_CR16","first-page":"171","volume":"27","author":"A Munier","year":"1993","unstructured":"Munier A (1993) R\u00e9gime asymptotique optimal d\u2019un graphe d\u2019\u00e9v\u00e9nements temporis\u00e9: application \u00e0 un probl\u00e9me d\u2019assemblage. RAIRO 27(5):171\u2013180","journal-title":"RAIRO"},{"issue":"3","key":"35_CR17","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0166-218X(94)00126-X","volume":"64","author":"A Munier","year":"1996","unstructured":"Munier A (1996) The basic cyclic scheduling problem with linear precedence constraints. Discret Appl Math 64(3):219\u2013238","journal-title":"Discret Appl Math"},{"key":"35_CR18","unstructured":"Murthy PM (1996) Scheduling techniques for synchronous and multidimensional synchronous dataflow. PhD Thesis, University of California at Berkeley"},{"issue":"3","key":"35_CR19","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1023\/A:1024055724914","volume":"13","author":"N Sauer","year":"2003","unstructured":"Sauer N (2003) Marking optimization of weighted marked graphs. Discret Event Dyn Syst 13(3):245\u2013262","journal-title":"Discret Event Dyn Syst"},{"key":"35_CR20","doi-asserted-by":"crossref","unstructured":"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\u2013367","DOI":"10.1007\/3-540-55676-1_20"}],"container-title":["Discrete Event Dynamic Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10626-007-0035-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10626-007-0035-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10626-007-0035-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:58:51Z","timestamp":1559231931000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10626-007-0035-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,5]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["35"],"URL":"https:\/\/doi.org\/10.1007\/s10626-007-0035-y","relation":{},"ISSN":["0924-6703","1573-7594"],"issn-type":[{"value":"0924-6703","type":"print"},{"value":"1573-7594","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1,5]]}}}