{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T11:13:46Z","timestamp":1725621226678},"reference-count":11,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1109\/memcod.2015.7340475","type":"proceedings-article","created":{"date-parts":[[2015,12,3]],"date-time":"2015-12-03T16:13:03Z","timestamp":1449159183000},"page":"96-101","source":"Crossref","is-referenced-by-count":4,"title":["Modeling resource sharing using FSM-SADF"],"prefix":"10.1109","author":[{"given":"Joao","family":"Bastos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sander","family":"Stuijk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeroen","family":"Voeten","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramon","family":"Schiffelers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johan","family":"Jacobs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henk","family":"Corporaal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1878961.1878985"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MEMCOD.2015.7340475"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/DSD.2011.78"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.5009446"},{"key":"ref11","first-page":"194","author":"yang","year":"2012","journal-title":"Playing games with scenario- and resource-aware SDF graphs through policy iteration Proc DATE'12"},{"key":"ref5","first-page":"25","author":"ghamarian","year":"2006","journal-title":"Throughput analysis of synchronous data flow graphs Proc ACSD'06"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/SAMOS.2011.6045491"},{"key":"ref7","article-title":"Multiprocessor resource allocation for throughput-constrained synchronous dataflow graphs","author":"stuijk","year":"0","journal-title":"Proc of DAC '07"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90010-8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.58"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSD.2014.13"}],"event":{"name":"2015 ACM\/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE)","start":{"date-parts":[[2015,9,21]]},"location":"Austin, TX, USA","end":{"date-parts":[[2015,9,23]]}},"container-title":["2015 ACM\/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7329076\/7340456\/07340475.pdf?arnumber=7340475","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T22:31:00Z","timestamp":1490394660000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7340475\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/memcod.2015.7340475","relation":{},"subject":[],"published":{"date-parts":[[2015,9]]}}}