{"id":"https://openalex.org/W2572022424","doi":"https://doi.org/10.1109/samos.2016.7818327","title":"Processes and actors: Translating Kahn processes to dataflow with firing","display_name":"Processes and actors: Translating Kahn processes to dataflow with firing","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2572022424","doi":"https://doi.org/10.1109/samos.2016.7818327","mag":"2572022424"},"language":"en","primary_location":{"id":"doi:10.1109/samos.2016.7818327","is_oa":false,"landing_page_url":"https://doi.org/10.1109/samos.2016.7818327","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation (SAMOS)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000885548","display_name":"Gustav Cedersj\u00f6","orcid":"https://orcid.org/0000-0003-0267-8969"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Gustav Cedersjo","raw_affiliation_strings":["Department of Computer Science, Lund University, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Sweden","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065449878","display_name":"J\u00f6rn W. Janneck","orcid":null},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Jorn W. Janneck","raw_affiliation_strings":["Department of Computer Science, Lund University, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Sweden","institution_ids":["https://openalex.org/I187531555"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5000885548"],"corresponding_institution_ids":["https://openalex.org/I187531555"],"apc_list":null,"apc_paid":null,"fwci":0.321,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.61760409,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"2016","issue":null,"first_page":"21","last_page":"30"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dataflow","display_name":"Dataflow","score":0.9863790273666382},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8683385252952576},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.7254896759986877},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.6183067560195923},{"id":"https://openalex.org/keywords/dataflow-architecture","display_name":"Dataflow architecture","score":0.5917893648147583},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.5394613742828369},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.47998878359794617},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.4705396294593811},{"id":"https://openalex.org/keywords/stream-processing","display_name":"Stream processing","score":0.4591374695301056},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4335895776748657},{"id":"https://openalex.org/keywords/programming-style","display_name":"Programming style","score":0.42977407574653625},{"id":"https://openalex.org/keywords/programming-paradigm","display_name":"Programming paradigm","score":0.4161131978034973},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.390962153673172},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3421257734298706}],"concepts":[{"id":"https://openalex.org/C96324660","wikidata":"https://www.wikidata.org/wiki/Q205446","display_name":"Dataflow","level":2,"score":0.9863790273666382},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8683385252952576},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7254896759986877},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.6183067560195923},{"id":"https://openalex.org/C176727019","wikidata":"https://www.wikidata.org/wiki/Q1172415","display_name":"Dataflow architecture","level":3,"score":0.5917893648147583},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.5394613742828369},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.47998878359794617},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.4705396294593811},{"id":"https://openalex.org/C107027933","wikidata":"https://www.wikidata.org/wiki/Q2006448","display_name":"Stream processing","level":2,"score":0.4591374695301056},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4335895776748657},{"id":"https://openalex.org/C2776245389","wikidata":"https://www.wikidata.org/wiki/Q962139","display_name":"Programming style","level":2,"score":0.42977407574653625},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.4161131978034973},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.390962153673172},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3421257734298706}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/samos.2016.7818327","is_oa":false,"landing_page_url":"https://doi.org/10.1109/samos.2016.7818327","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation (SAMOS)","raw_type":"proceedings-article"},{"id":"pmh:oai:lup.lub.lu.se:4700dc55-8024-4d9d-8c75-18d60d6895e5","is_oa":false,"landing_page_url":"https://lup.lub.lu.se/record/4700dc55-8024-4d9d-8c75-18d60d6895e5","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:2747866314","is_oa":false,"landing_page_url":"http://jglobal.jst.go.jp/en/public/20090422/201702247692687204","pdf_url":null,"source":{"id":"https://openalex.org/S4306512817","display_name":"IEEE Conference Proceedings","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"IEEE Conference Proceedings","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W202631676","https://openalex.org/W1487134436","https://openalex.org/W1496267491","https://openalex.org/W1521891776","https://openalex.org/W1528880846","https://openalex.org/W1535347731","https://openalex.org/W1556393540","https://openalex.org/W1568192366","https://openalex.org/W1597755753","https://openalex.org/W1603799276","https://openalex.org/W1726791785","https://openalex.org/W1970832884","https://openalex.org/W1972591981","https://openalex.org/W2013878293","https://openalex.org/W2018720121","https://openalex.org/W2045255985","https://openalex.org/W2066552422","https://openalex.org/W2070385897","https://openalex.org/W2091158003","https://openalex.org/W2110425399","https://openalex.org/W2140837302","https://openalex.org/W2144921311","https://openalex.org/W2167756215","https://openalex.org/W4211008702","https://openalex.org/W4285719527","https://openalex.org/W6608326232","https://openalex.org/W6629040167","https://openalex.org/W6629762304","https://openalex.org/W6631160967","https://openalex.org/W6632165618","https://openalex.org/W6635964534","https://openalex.org/W6637583060"],"related_works":["https://openalex.org/W2564598376","https://openalex.org/W1484403103","https://openalex.org/W2584408851","https://openalex.org/W2077180914","https://openalex.org/W1989140795","https://openalex.org/W2521218765","https://openalex.org/W2403307847","https://openalex.org/W1981433684","https://openalex.org/W2041491054","https://openalex.org/W1500554780"],"abstract_inverted_index":{"Dataflow":[0,29],"programming":[1,189],"is":[2],"a":[3,11,101,106,111,128,143,158,172,184],"paradigm":[4],"for":[5,54,61,186],"describing":[6],"stream":[7],"processing":[8],"algorithms":[9],"in":[10,100,151,183],"manner":[12,103],"that":[13,39,167],"naturally":[14],"exposes":[15],"their":[16],"concurrency":[17],"and":[18,59,87,164,165,177],"makes":[19],"the":[20,41,45,55,73,78,82,133,187],"resulting":[21],"programs":[22,30,86,149],"readily":[23],"implementable":[24],"on":[25],"highly":[26],"parallel":[27],"architectures.":[28],"are":[31,48],"graph":[32],"structured,":[33],"with":[34,63,116],"nodes":[35],"representing":[36],"computational":[37],"kernels":[38],"process":[40,57,112],"data":[42],"flowing":[43],"over":[44],"edges.":[46],"There":[47],"two":[49],"major":[50],"families":[51],"of":[52,84,108,130,135,146,160,171],"languages":[53,58,60],"kernels:":[56],"dataflow":[62,85,115,188],"firing.":[64,117],"While":[65],"processes":[66],"tend":[67],"to":[68,71,96,114,120,132,141],"be":[69],"easier":[70],"write,":[72],"additional":[74],"structure":[75],"provided":[76],"by":[77,104],"dataflow-with-firing":[79],"style":[80],"increases":[81],"analyzability":[83],"supports":[88],"more":[89],"efficient":[90],"implementation":[91],"techniques.":[92],"This":[93],"paper":[94],"seeks":[95],"combine":[97],"these":[98,123,152],"benefits":[99],"principled":[102],"constructing":[105],"family":[107,159],"translations":[109,161],"from":[110],"language":[113,176,190],"In":[118],"order":[119],"formally":[121],"relate":[122],"descriptions,":[124],"we":[125,156],"first":[126],"introduce":[127,157],"notion":[129],"firing":[131],"semantics":[134],"Kahn":[136],"processes,":[137],"which":[138],"allows":[139],"us":[140],"give":[142],"precise":[144],"definition":[145],"equivalence":[147],"between":[148,162],"written":[150],"different":[153],"styles.":[154],"Then":[155],"them":[163],"show":[166],"they":[168],"retain":[169],"meaning":[170],"program.":[173],"The":[174],"presented":[175],"its":[178],"translation":[179],"has":[180],"been":[181],"implemented":[182],"compiler":[185],"CAL.":[191]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}