{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T16:31:53Z","timestamp":1694622713462},"reference-count":19,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[2003,12]]},"abstract":"<jats:title>Abstract.<\/jats:title>\n          <jats:p>We compare two semantic models of dataflow programs: a synchronous version of the classical Kahn semantics, and a new semantics in a category of synchronous processes. We consider the Kahn semantics to be extensional, as it describes the functions computed by dataflow nodes, and the categorical semantics to be intensional, as it describes the step-by-step production of output tokens from input tokens. Assuming that programs satisfy Wadge\u2019s cycle sum condition and are therefore deadlock-free, we prove that the two semantics are equivalent. This equivalence result amounts to a proof that function composition in the extensional semantics is faithfully modelled by the detailed interactions of the intensional semantics, and provides further insight into the nature of dataflow computation.<\/jats:p>","DOI":"10.1007\/s00165-003-0018-1","type":"journal-article","created":{"date-parts":[[2003,12,23]],"date-time":"2003-12-23T20:14:14Z","timestamp":1072210454000},"page":"299-318","source":"Crossref","is-referenced-by-count":2,"title":["Intensional and Extensional Semantics of Dataflow Programs"],"prefix":"10.1145","volume":"15","author":[{"given":"Simon","family":"Gay","sequence":"first","affiliation":[{"name":"Department of Computing Science, University of Glasgow, G12 8QQ, Glasgow, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajagopal","family":"Nagarajan","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Warwick, Coventry, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"p_1","first-page":"57","volume-title":"Theory and Formal Methods 1993: Proceedings of the First Imperial College Department of Computing Workshop on Theory and Formal Methods, Workshops in Computer Science","author":"Abr","year":"1993"},{"key":"p_2","volume-title":"Non-Well-Founded Sets. CSLI Lecture Notes 14","author":"Acz","year":"1988"},{"key":"p_3","volume-title":"Deductive Program Design: Proceedings of the 1994 Marktoberdorf International Summer School, NATO ASI Series F: Computer and Systems Sciences","author":"Abramsky S.","year":"1995"},{"key":"p_4","series-title":"Lecture Notes in Computer Science","volume-title":"Logics for Concurrency: Structure vs. Automata: Proceedings of the VIIIth Banff Higher Order Workshop","author":"Abramsky S.","year":"1996"},{"issue":"1","key":"p_5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(98)00189-3","article-title":"A specification structure for deadlock-freedom of synchronous processes","volume":"222","author":"Abramsky S.","year":"1999","journal-title":"Theoretical Computer Science"},{"key":"p_6","volume-title":"Lucid, the data-flow programming language","author":"As","year":"1985"},{"key":"p_7","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0064579","volume-title":"\u2217-Autonomous Categories","author":"Bar","year":"1979"},{"issue":"2","key":"p_8","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0167-6423(91)90001-E","article-title":"Synchronous programming with events and relations: the Signal language and its semantics","volume":"16","author":"Be","year":"1991","journal-title":"Science of Computer Programming"},{"key":"p_10","volume-title":"Theory and Formal Methods 1993: Proceedings of the First Imperial College Department of Computing Workshop on Theory and Formal Methods. Workshops in Computer Science","author":"Ga","year":"1993"},{"issue":"9","key":"p_11","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1109\/5.97300","article-title":"The synchronous data flow programming language Lustre","volume":"79","author":"Halbwachs N.","year":"1991","journal-title":"Proceedings of the IEEE"},{"key":"p_12","volume-title":"Premonoidal categories and a graphical view of programs. Electronic publication: http:\/\/klee.cs.depaul.edu\/premon\/paper.html","author":"Jef","year":"1997"},{"key":"p_13","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1017\/S0305004100074338","article-title":"Traced monoidal categories","volume":"119","author":"Joyal A.","year":"1996","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"key":"p_14","first-page":"471","volume-title":"Proceedings of Information Processing '74","author":"Kah","year":"1974"},{"issue":"9","key":"p_15","doi-asserted-by":"crossref","first-page":"1321","DOI":"10.1109\/5.97301","article-title":"Programming real-time applications with Signal","volume":"79","author":"Le Guernic P.","year":"1991","journal-title":"Proceedings of the IEEE"},{"issue":"9","key":"p_16","doi-asserted-by":"crossref","first-page":"1235","DOI":"10.1109\/PROC.1987.13876","article-title":"Synchronous dataflow","volume":"75","author":"Le","year":"1987","journal-title":"Proceedings of the IEEE"},{"key":"p_17","volume-title":"Categories for the Working Mathematician","author":"Mac","year":"1971"},{"key":"p_18","volume-title":"Communication and Concurrency","author":"Mil","year":"1989"},{"key":"p_20","volume-title":"Network Algebra","author":"Ste","year":"2000"},{"key":"p_21","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(81)90108-0","article-title":"An extensional treatment of dataflow deadlock","volume":"13","author":"Wad","year":"1981","journal-title":"Theoretical Computer Science"}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00165-003-0018-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00165-003-0018-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1007\/s00165-003-0018-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T15:41:40Z","timestamp":1641483700000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1007\/s00165-003-0018-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["10.1007\/s00165-003-0018-1"],"URL":"https:\/\/doi.org\/10.1007\/s00165-003-0018-1","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}