{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:37:52Z","timestamp":1725493072115},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440499"},{"type":"electronic","value":"9783540457060"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45706-2_17","type":"book-chapter","created":{"date-parts":[[2007,10,7]],"date-time":"2007-10-07T05:37:18Z","timestamp":1191735438000},"page":"137-146","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Multi-periodic Process Networks: Prototyping and Verifying Stream-Processing Systems"],"prefix":"10.1007","author":[{"given":"Albert","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniela","family":"Genius","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdesslem","family":"Kortebi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zbigniew","family":"Chamski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Duranton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Feautrier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,20]]},"reference":[{"key":"17_CR1","unstructured":"F. Baccelli, G. Cohen, G. J. Olsder, and J.-P. Quadrat. Synchronization and Linearity. Wiley, 1992."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"G. Berry, P. Couronn\u00e9, and G. Gonthier. The synchronous approach to reactive and real-time systems. Proc. IEEE, 79(9):1270\u20131282, Sept. 1991.","DOI":"10.1109\/5.97297"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"B. Berthomieu and M. Diaz. Modelling and Verification of Time-Dependent Systems Using Time Petri Nets. IEEE Trans. on Software Eng., 17, Mar. 1991.","DOI":"10.1109\/32.75415"},{"key":"17_CR4","series-title":"Lect Notes Comput Sci","volume-title":"Network Calculus","author":"J.-Y. L. Boudec","year":"2002","unstructured":"J.-Y. L. Boudec and P. Thiran. Network Calculus. Springer LNCS 2050, Jan. 2002."},{"key":"17_CR5","unstructured":"J. T. Buck, S. Ha, E. A. Lee, and D. G. Messerschmitt. Ptolemy: A framework for simulating and prototyping heterogeneous systems. J. Comp. Simulation, 4, 1992."},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"P. Caspi and M. Pouzet. Synchronous Kahn Networks. In ACM SIGPLAN Int. Conference on Functional Programming (ICFP), Philadelphia, May 1996. ACM.","DOI":"10.1145\/232627.232651"},{"key":"17_CR7","unstructured":"A. Cohen and D. Genius. Multi-periodic process networks: Technical report. \n                    http:\/\/www-rocq.inria.fr\/~acohen\/publications\/mppn\n                    \n                  , 2002."},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"G. Cohen, S. Gaubert, and J.-P. Quadrat. Algebraic system analysis of timed petri nets. Idempotency, Cambridge University Press, 1997.","DOI":"10.1017\/CBO9780511662508.010"},{"key":"17_CR9","unstructured":"G. Kahn. The Semantics of a Simple Language for Parallel Programming. In IFIP 74 Congress, Amsterdam, 1974. North-Holland."},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"B. Kienhuis, E. Rijpkema, and E. Deprettere. Compaan: Deriving process networks from matlab for embedded signal processing architectures. In Proc. 8th workshop CODES, pages 13\u201317, NY, May 3\u20135 2000. ACM.","DOI":"10.1145\/334012.334015"},{"issue":"4","key":"17_CR11","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0743-7315(90)90034-M","volume":"10","author":"E. A. Lee","year":"1990","unstructured":"E. A. Lee and J. C. Bier. Architectures for statically scheduled dataflow. J. Parallel and Distributed Computing, 10(4):333\u2013348, Dec. 1990.","journal-title":"J. Parallel and Distributed Computing"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00925828","volume":"3","author":"H. Leverge","year":"1991","unstructured":"H. Leverge, C. Mauras, and P. Quinton. The Alpha language and its use for the design of systolic arrays. J. of VLSI Signal Processing, 3:173\u2013182, 1991.","journal-title":"J. of VLSI Signal Processing"},{"key":"17_CR13","unstructured":"P. S\u00e9nac and M. Diaz. Time Streams Petri Nets, A Model for Timed Multimedia Informations. In 16th Int. Conf. Appl. and Theory of Petri Nets, Turin, June 1995."}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2002 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45706-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:19:13Z","timestamp":1587341953000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45706-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440499","9783540457060"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45706-2_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"20 August 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}