The polychronous model of computation and Kahn process networks

In 1974, Gilles Khan defined a seminal semantic model for asynchronous dataflow programming that would then be called as the eponymous Kahn process networks (KPN) and instantiated in as many models of the so-called DPN hierarchy as domain-specific fields of information processing from digital signal...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Science of computer programming Jg. 228; S. 102958 - 49
Hauptverfasser: Gautier, Thierry, Le Guernic, Paul, Besnard, Loïc, Talpin, Jean-Pierre
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.06.2023
Elsevier
Schlagworte:
ISSN:0167-6423, 1872-7964
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract In 1974, Gilles Khan defined a seminal semantic model for asynchronous dataflow programming that would then be called as the eponymous Kahn process networks (KPN) and instantiated in as many models of the so-called DPN hierarchy as domain-specific fields of information processing from digital signal processing to hybrid cyber-physical systems. Among these, synchronous programming models have had an important impact in the specific domain of embedded software design. In this paper, we consider an instance of what seems to be one of the many synchronous models of computation: polychrony, initiated by the dataflow language Signal and its multi-clock (i.e. polychronous) model of computation and, later on, CCSL (clock constraints specification language). We provide an in-depth study of its semantic relationship with respect to the original definition of KPNs and hint toward the idea of polychrony as a methodology to locally synchronize (abstractions of) globally asynchronous processes. In particular, we formally define the property, referred to as “polyendochrony”, that allows one to consider a given desynchronized network of synchronous Signal processes (a GALS architecture) as the implementation of a corresponding KPN model (an asynchronous network of Khan-deterministic functions). For this class of networks, we formalize the Signal program analysis and transformations that define synchronous clusters of Signal processes of guaranteed deterministic behavior in an asynchronous network, that is, without synchronizing communications in the entire network. This definition yields a new strategy of multi-threaded code generation that is available in the open-source Polychrony toolset of the Signal language and blurs the limits between the asynchronous and polychronous models of computation.
AbstractList In 1974, Gilles Kahn defined a seminal semantic model for asynchronous dataflow programming that would then be called as the eponymous Kahn process networks (KPN) and instantiated in as many models of the so-called DPN hierarchy as domain-specific fields of information processing from digital signal processing to hybrid cyber-physical systems. Among these, synchronous programming models have had an important impact in the specific domain of embedded system design. In this paper, we consider an instance of what seems to be one of the many synchronous models of computation: polychrony, initiated by the dataflow language Signal and its multi-clock (i.e. polychronous) model of computation and, later on, CCSL (clock constraints specification language). We provide an in-depth study of its semantic relationships with respect to the original definition of KPNs and hint toward the idea of polychrony as a methodology to locally synchronize (abstractions of) globally asynchronous processes. In particular, we formally define the property, referred to as "polyendochrony", that allow to consider a given desynchronized network of synchronous Signal processes (a GALS architecture) as an implementation of a corresponding KPN model (an asynchronous network of Khan-deterministic functions). For this class of networks, we formalize the Signal program analysis and transformations that defines synchronous clusters of Signal processes of guaranteed deterministic behavior in an asynchronous network, that is, without synchronizing communications in the entire network. This definition yields a new strategy of multi-threaded code generation that is available in the open-source Polychrony toolset of the Signal language and blurs the limits between asynchronous and polychronous models of computation.
In 1974, Gilles Khan defined a seminal semantic model for asynchronous dataflow programming that would then be called as the eponymous Kahn process networks (KPN) and instantiated in as many models of the so-called DPN hierarchy as domain-specific fields of information processing from digital signal processing to hybrid cyber-physical systems. Among these, synchronous programming models have had an important impact in the specific domain of embedded software design. In this paper, we consider an instance of what seems to be one of the many synchronous models of computation: polychrony, initiated by the dataflow language Signal and its multi-clock (i.e. polychronous) model of computation and, later on, CCSL (clock constraints specification language). We provide an in-depth study of its semantic relationship with respect to the original definition of KPNs and hint toward the idea of polychrony as a methodology to locally synchronize (abstractions of) globally asynchronous processes. In particular, we formally define the property, referred to as “polyendochrony”, that allows one to consider a given desynchronized network of synchronous Signal processes (a GALS architecture) as the implementation of a corresponding KPN model (an asynchronous network of Khan-deterministic functions). For this class of networks, we formalize the Signal program analysis and transformations that define synchronous clusters of Signal processes of guaranteed deterministic behavior in an asynchronous network, that is, without synchronizing communications in the entire network. This definition yields a new strategy of multi-threaded code generation that is available in the open-source Polychrony toolset of the Signal language and blurs the limits between the asynchronous and polychronous models of computation.
ArticleNumber 102958
Author Besnard, Loïc
Talpin, Jean-Pierre
Le Guernic, Paul
Gautier, Thierry
Author_xml – sequence: 1
  givenname: Thierry
  surname: Gautier
  fullname: Gautier, Thierry
  organization: Inria, IRISA, Campus de Beaulieu, 35042 Rennes Cedex, France
– sequence: 2
  givenname: Paul
  surname: Le Guernic
  fullname: Le Guernic, Paul
  organization: Inria, IRISA, Campus de Beaulieu, 35042 Rennes Cedex, France
– sequence: 3
  givenname: Loïc
  surname: Besnard
  fullname: Besnard, Loïc
  organization: CNRS, IRISA, Campus de Beaulieu, 35042 Rennes Cedex, France
– sequence: 4
  givenname: Jean-Pierre
  surname: Talpin
  fullname: Talpin, Jean-Pierre
  email: Jean-Pierre.Talpin@inria.fr
  organization: Inria, IRISA, Campus de Beaulieu, 35042 Rennes Cedex, France
BackLink https://inria.hal.science/hal-04216543$$DView record in HAL
BookMark eNqFkEFLwzAUgINMcJv-Ai-5euhM0jZpDiJjqBMHXuY5ZK8JzeyakXST_XtbKx486OnB4_sevG-CRo1vDELXlMwoofx2O4vgwM8YYWm3YTIvztCYFoIlQvJshMYdJRKesfQCTWLcEkJ4JugY3a8rg_e-PkEVfOMPEe98aWrsLQa_2x9a3TrfYN2U-EVXDd4HDyZG3Jj2w4f3eInOra6jufqeU_T2-LBeLJPV69PzYr5KIC1YmwDhIEoB0jImpShKylNBxYZYQqWQuWVSl6LgAoDZzG4otTkAzwpbUC20TafoZrhb6Vrtg9vpcFJeO7Wcr1S_IxmjPM_SI-3YdGAh-BiDsT8CJarvpbbqq5fqe6mhV2fJXxa44fs2aFf_494NrukSHJ0JPWMaMKULBlpVeven_wkcGoj8
CitedBy_id crossref_primary_10_1109_ACCESS_2024_3411017
Cites_doi 10.1142/S0218126603000763
10.1016/0304-3975(83)90114-7
10.1109/5.97300
10.1007/s11704-015-4364-y
10.1109/43.736561
10.1016/j.scico.2021.102644
10.1016/0890-5401(92)90008-4
10.1145/232629.232651
10.1109/5.97301
10.1016/S0019-9958(84)80025-X
10.1016/0890-5401(92)90043-F
10.1016/j.scico.2014.04.009
10.1007/s10703-006-7844-8
10.1016/j.tcs.2008.08.044
10.1109/5.97297
10.1109/JPROC.2002.805826
10.1016/j.scico.2010.06.006
10.1109/5.381846
10.1023/A:1008796718837
10.1006/inco.2000.9999
10.1016/0304-3975(92)90326-B
10.1109/TC.1987.5009446
ContentType Journal Article
Copyright 2023 Elsevier B.V.
Attribution
Copyright_xml – notice: 2023 Elsevier B.V.
– notice: Attribution
DBID AAYXX
CITATION
1XC
VOOES
DOI 10.1016/j.scico.2023.102958
DatabaseName CrossRef
Hyper Article en Ligne (HAL)
Hyper Article en Ligne (HAL) (Open Access)
DatabaseTitle CrossRef
DatabaseTitleList

DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1872-7964
EndPage 49
ExternalDocumentID oai:HAL:hal-04216543v1
10_1016_j_scico_2023_102958
S0167642323000400
GroupedDBID --K
--M
.DC
.~1
0R~
123
1B1
1RT
1~.
1~5
4.4
457
4G.
5VS
6I.
7-5
71M
8P~
9JN
AACTN
AAEDT
AAEDW
AAFTH
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABBOA
ABFNM
ABJNI
ABMAC
ABTAH
ABVKL
ABXDB
ABYKQ
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADHUB
ADMUD
AEBSH
AEKER
AENEX
AEXQZ
AFFNX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
AKRWK
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CS3
DU5
E.L
EBS
EFJIC
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
GBLVA
GBOLZ
HVGLF
HZ~
IHE
IXB
J1W
KOM
LG9
M26
M41
MO0
N9A
NCXOZ
O-L
O9-
OAUVE
OK1
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
ROL
RPZ
SDF
SDG
SDP
SES
SEW
SPC
SPCBC
SSV
SSZ
T5K
TN5
WUQ
XPP
ZMT
ZY4
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
ADVLN
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKYEP
ANKPU
APXCP
CITATION
EFKBS
EFLBG
~HD
1XC
VOOES
ID FETCH-LOGICAL-c382t-c06c7d7c9f229978d163717b0f019795f29ad7867cc2f4fb11f5cc648f81a7af3
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001001592000001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0167-6423
IngestDate Tue Oct 14 20:33:08 EDT 2025
Sat Nov 29 07:26:52 EST 2025
Tue Nov 18 21:43:19 EST 2025
Fri Apr 05 04:25:45 EDT 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Keywords Synchrony and asynchrony
Synchronous languages
Semantics of programming languages
Kahn process networks
Formal methods
semantics of programming languages
synchronous languages
synchrony and asynchrony
formal methods
Language English
License Attribution: http://creativecommons.org/licenses/by
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c382t-c06c7d7c9f229978d163717b0f019795f29ad7867cc2f4fb11f5cc648f81a7af3
ORCID 0000-0002-0556-4265
OpenAccessLink https://inria.hal.science/hal-04216543
PageCount 49
ParticipantIDs hal_primary_oai_HAL_hal_04216543v1
crossref_primary_10_1016_j_scico_2023_102958
crossref_citationtrail_10_1016_j_scico_2023_102958
elsevier_sciencedirect_doi_10_1016_j_scico_2023_102958
PublicationCentury 2000
PublicationDate 2023-06-01
PublicationDateYYYYMMDD 2023-06-01
PublicationDate_xml – month: 06
  year: 2023
  text: 2023-06-01
  day: 01
PublicationDecade 2020
PublicationTitle Science of computer programming
PublicationYear 2023
Publisher Elsevier B.V
Elsevier
Publisher_xml – name: Elsevier B.V
– name: Elsevier
References Ouy (br0240) Jan. 2008
Le Guernic, Gautier, Le Borgne, Le Maire (br0090) 1991; 79
Geilen, Basten (br0460) 2003
Liu, Lee (br0400) 2008; 409
Besnard (br0500) Sep. 1992
Milner (br0020) 1980
Besnard, Gautier, Le Guernic (br0260) 2020
Goel (br0440) 1998
Bergstra, Klop, Tucker (br0120) 1985
Glouche, Gautier, Le Guernic, Talpin (br0520) 2010
Potop-Butucaru, de Simone, Sorel, Talpin (br0220) 2009
Raymond, Halbwachs, Caspi, Pilaud (br0310) 1991; 79
Le Guernic, Gautier (br0140) 1991
Panangaden (br0290) 1995
Caspi (br0150) 1992; 94
(br0370) 2014
Panangaden, Shanbhogue (br0300) 1992; 98
Lee, Sangiovanni-Vincentelli (br0390) 1998; 17
Brock, Ackerman (br0280) 1981
Benveniste, Berry (br0070) 1991; 79
Stevens, Wan, Laramie, Parks, Lee (br0430) 1997
Benveniste, Caspi, Le Guernic, Marchand, Talpin, Tripakis (br0510) 2002
Caspi, Girault (br0160) 1995; vol. 966
de Kock, Smits, van der Wolf, Brunel, Kruijtzer, Lieverse, Vissers, Essink (br0450) 2000
Cohen, Mandel, Plateau, Pouzet (br0480) 2008
Talpin, Brandt, Gemünde, Schneider, Wang, Shukla (br0560) 2014; 96
Milner (br0130) 1983; 25
Le Guernic, Talpin, Le Lann (br0100) 2003; 12
Caspi, Pouzet (br0330) 1996; 31
Parks (br0420) 1995
Milner, Parrow, Walker (br0040) 1992; 100
Carloni, McMillan, Sangiovanni-Vincentelli (br0230) 1999; vol. 1633
Benveniste, Caillaud, Le Guernic (br0180) 2000; 163
Caspi, Benveniste, Lublinerman, Tripakis (br0380) 2009
Hylands, Lee, Liu, Liu, Neuendorffer, Xiong, Zhao, Zheng (br0360) July 2003
Hoare (br0010) 1985
Gamatié (br0110) 2009
Benveniste, Caspi, Edwards, Halbwachs, Le Guernic, de Simone (br0080) 2003; 91
Lee, Parks (br0050) 1995; 83
Wadler (br0340) 1984
Berry, Sentovich (br0170) 2000; 17
Lee, Messerschmitt (br0350) 1987; 36
Yang, Yuan, Bodeveix, Filali, Wang, Zhou (br0550) 2021; 207
Potop-Butucaru, Caillaud, Benveniste (br0200) 2006; 28
Talpin, Potop-Butucaru, Ouy, Caillaud (br0190) 2005
Geilen, Basten (br0270) 2010
Potop-Butucaru, Caillaud (br0210) 2007; 78
Kahn (br0060) 1974
Amagbegnon, Besnard, Le Guernic (br0320) 1995
Buck, Lee (br0410) 1993; vol. 1
Bergstra, Klop (br0030) 1984; 60
Yang, Bodeveix, Filali, Hu, Zhao, Ma (br0540) 2016; 10
Talpin, Ouy, Gautier, Besnard, Le Guernic (br0250) 2012; 77
Cohen, Duranton, Eisenbeis, Pagetti, Plateau, Pouzet (br0470) 2006
Besnard, Gautier, Le Guernic, Talpin (br0530) 2010
Amagbegnon, Besnard, Le Guernic (br0490) 1994
Buck (10.1016/j.scico.2023.102958_br0410) 1993; vol. 1
Benveniste (10.1016/j.scico.2023.102958_br0080) 2003; 91
Le Guernic (10.1016/j.scico.2023.102958_br0090) 1991; 79
Berry (10.1016/j.scico.2023.102958_br0170) 2000; 17
Geilen (10.1016/j.scico.2023.102958_br0270) 2010
Yang (10.1016/j.scico.2023.102958_br0540) 2016; 10
Gamatié (10.1016/j.scico.2023.102958_br0110) 2009
Stevens (10.1016/j.scico.2023.102958_br0430) 1997
(10.1016/j.scico.2023.102958_br0370) 2014
Wadler (10.1016/j.scico.2023.102958_br0340) 1984
Lee (10.1016/j.scico.2023.102958_br0350) 1987; 36
Glouche (10.1016/j.scico.2023.102958_br0520) 2010
Caspi (10.1016/j.scico.2023.102958_br0380) 2009
Milner (10.1016/j.scico.2023.102958_br0020) 1980
Ouy (10.1016/j.scico.2023.102958_br0240) 2008
Besnard (10.1016/j.scico.2023.102958_br0500) 1992
Panangaden (10.1016/j.scico.2023.102958_br0290) 1995
Potop-Butucaru (10.1016/j.scico.2023.102958_br0200) 2006; 28
Le Guernic (10.1016/j.scico.2023.102958_br0100) 2003; 12
Lee (10.1016/j.scico.2023.102958_br0390) 1998; 17
Caspi (10.1016/j.scico.2023.102958_br0330) 1996; 31
Brock (10.1016/j.scico.2023.102958_br0280) 1981
Hylands (10.1016/j.scico.2023.102958_br0360) 2003
Milner (10.1016/j.scico.2023.102958_br0040) 1992; 100
Bergstra (10.1016/j.scico.2023.102958_br0120) 1985
Cohen (10.1016/j.scico.2023.102958_br0470) 2006
Benveniste (10.1016/j.scico.2023.102958_br0510) 2002
Amagbegnon (10.1016/j.scico.2023.102958_br0320) 1995
Besnard (10.1016/j.scico.2023.102958_br0530) 2010
Le Guernic (10.1016/j.scico.2023.102958_br0140) 1991
Panangaden (10.1016/j.scico.2023.102958_br0300) 1992; 98
Liu (10.1016/j.scico.2023.102958_br0400) 2008; 409
Talpin (10.1016/j.scico.2023.102958_br0190) 2005
Bergstra (10.1016/j.scico.2023.102958_br0030) 1984; 60
Yang (10.1016/j.scico.2023.102958_br0550) 2021; 207
Milner (10.1016/j.scico.2023.102958_br0130) 1983; 25
Cohen (10.1016/j.scico.2023.102958_br0480) 2008
Hoare (10.1016/j.scico.2023.102958_br0010) 1985
Caspi (10.1016/j.scico.2023.102958_br0150) 1992; 94
Raymond (10.1016/j.scico.2023.102958_br0310) 1991; 79
Lee (10.1016/j.scico.2023.102958_br0050) 1995; 83
Benveniste (10.1016/j.scico.2023.102958_br0070) 1991; 79
Caspi (10.1016/j.scico.2023.102958_br0160) 1995; vol. 966
Talpin (10.1016/j.scico.2023.102958_br0560) 2014; 96
Parks (10.1016/j.scico.2023.102958_br0420) 1995
de Kock (10.1016/j.scico.2023.102958_br0450) 2000
Talpin (10.1016/j.scico.2023.102958_br0250) 2012; 77
Kahn (10.1016/j.scico.2023.102958_br0060) 1974
Benveniste (10.1016/j.scico.2023.102958_br0180) 2000; 163
Besnard (10.1016/j.scico.2023.102958_br0260)
Potop-Butucaru (10.1016/j.scico.2023.102958_br0220) 2009
Carloni (10.1016/j.scico.2023.102958_br0230) 1999; vol. 1633
Geilen (10.1016/j.scico.2023.102958_br0460) 2003
Amagbegnon (10.1016/j.scico.2023.102958_br0490) 1994
Potop-Butucaru (10.1016/j.scico.2023.102958_br0210) 2007; 78
Goel (10.1016/j.scico.2023.102958_br0440) 1998
References_xml – volume: 31
  start-page: 226
  year: 1996
  end-page: 238
  ident: br0330
  article-title: Synchronous Kahn networks
  publication-title: SIGPLAN Not.
– start-page: 124
  year: 1995
  end-page: 150
  ident: br0290
  article-title: The expressive power of indeterminate primitives in asynchronous computation
  publication-title: Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
– start-page: 42
  year: 2009
  end-page: 51
  ident: br0220
  article-title: From concurrent multiclock programs to deterministic asynchronous implementations
  publication-title: 2009 9th International Conference on Application of Concurrency to System Design (ACSD 2009)
– year: 1994
  ident: br0490
  article-title: Arborescent canonical form of Boolean expressions
– volume: 79
  start-page: 1321
  year: 1991
  end-page: 1336
  ident: br0090
  article-title: Programming real-time applications with
  publication-title: Proc. IEEE
– volume: 17
  start-page: 1217
  year: 1998
  end-page: 1229
  ident: br0390
  article-title: A framework for comparing models of computation
  publication-title: IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.
– year: 1995
  ident: br0420
  article-title: Bounded scheduling of process networks
– volume: 409
  start-page: 110
  year: 2008
  end-page: 125
  ident: br0400
  article-title: CPO semantics of timed interactive actor networks
  publication-title: Theor. Comput. Sci.
– start-page: 45
  year: 1984
  end-page: 52
  ident: br0340
  article-title: Listlessness is better than laziness: lazy evaluation and garbage collection at compile-time
  publication-title: LFP ’84: Proceedings of the 1984 ACM Symposium on LISP and Functional Programming
– volume: 79
  start-page: 1270
  year: 1991
  end-page: 1282
  ident: br0070
  article-title: The synchronous approach to reactive and real-time systems
  publication-title: Proc. IEEE
– start-page: 402
  year: 2000
  end-page: 405
  ident: br0450
  article-title: YAPI: application modeling for signal processing systems
  publication-title: DAC ’00: Proceedings of the 37th Annual Design Automation Conference
– start-page: 413
  year: 1991
  end-page: 438
  ident: br0140
  article-title: Data-flow to von Neumann: the SIGNAL approach
  publication-title: Advanced Topics in Data-Flow Computing
– volume: 207
  year: 2021
  ident: br0550
  article-title: Multi-task Ada code generation from synchronous dataflow programs on multi-core: approach and industrial study
  publication-title: Sci. Comput. Program.
– start-page: 282
  year: 2005
  end-page: 285
  ident: br0190
  article-title: From multi-clocked synchronous processes to latency-insensitive modules
  publication-title: 5th ACM International Conference on Embedded Software
– start-page: 471
  year: 1974
  end-page: 475
  ident: br0060
  article-title: The semantics of a simple language for parallel programming
  publication-title: Information Processing '74: Proceedings of the IFIP Congress
– volume: 36
  start-page: 24
  year: 1987
  end-page: 35
  ident: br0350
  article-title: Static scheduling of synchronous data flow programs for digital signal processing
  publication-title: IEEE Trans. Comput.
– volume: 83
  start-page: 773
  year: 1995
  end-page: 801
  ident: br0050
  article-title: Dataflow process networks
  publication-title: Proc. IEEE
– year: 1980
  ident: br0020
  article-title: A Calculus of Communicating Systems
– start-page: 967
  year: 2010
  end-page: 1006
  ident: br0270
  article-title: Kahn process networks and a reactive extension
  publication-title: Handbook of Signal Processing Systems
– volume: 78
  start-page: 131
  year: 2007
  end-page: 159
  ident: br0210
  article-title: Correct-by-construction asynchronous implementation of modular synchronous specifications
  publication-title: Fundam. Inform.
– start-page: 252
  year: 1981
  end-page: 259
  ident: br0280
  article-title: Scenarios: a model of non-determinate computation
  publication-title: Proceedings of the International Colloquium on Formalization of Programming Concepts
– year: July 2003
  ident: br0360
  article-title: Overview of the Ptolemy project
– volume: 17
  start-page: 135
  year: 2000
  end-page: 161
  ident: br0170
  article-title: An implementation of constructive synchronous programs in POLIS
  publication-title: Form. Methods Syst. Des.
– start-page: 180
  year: 2006
  end-page: 193
  ident: br0470
  article-title: N-synchronous Kahn networks: a relaxed model of synchrony for real-time systems
  publication-title: POPL ‘06: Conference Record of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
– volume: vol. 966
  start-page: 15
  year: 1995
  end-page: 26
  ident: br0160
  article-title: Execution of distributed reactive systems
  publication-title: Euro-Par ’95 Parallel Processing, First International Euro-Par Conference
– start-page: 319
  year: 2003
  end-page: 334
  ident: br0460
  article-title: Requirements on the execution of Kahn process networks
  publication-title: Proc. of the 12th European Symposium on Programming, ESOP 2003
– volume: 28
  start-page: 111
  year: 2006
  end-page: 130
  ident: br0200
  article-title: Concurrency in synchronous systems
  publication-title: Form. Methods Syst. Des.
– start-page: 252
  year: 2002
  end-page: 265
  ident: br0510
  article-title: A protocol for loosely time-triggered architectures
  publication-title: Embedded Software
– start-page: 163
  year: 1995
  end-page: 173
  ident: br0320
  article-title: Implementation of the data-flow synchronous language
  publication-title: Programming Languages Design and Implementation
– start-page: 237
  year: 2008
  end-page: 254
  ident: br0480
  article-title: Abstraction of clocks in synchronous data-flow systems
  publication-title: APLAS ’08: Proceedings of the 6th Asian Symposium on Programming Languages and Systems
– volume: 163
  start-page: 125
  year: 2000
  end-page: 171
  ident: br0180
  article-title: Compositionality in dataflow synchronous languages: specification and distributed code generation
  publication-title: Inf. Comput.
– volume: 100
  start-page: 1
  year: 1992
  end-page: 77
  ident: br0040
  article-title: A calculus of mobile processes (parts I and II)
  publication-title: Inf. Comput.
– start-page: 147
  year: 2010
  end-page: 171
  ident: br0520
  article-title: A module language for typing SIGNAL programs by contracts
  publication-title: Synthesis of Embedded Software
– volume: 96
  year: 2014
  ident: br0560
  article-title: Constructive polychronous systems
  publication-title: Sci. Comput. Program.
– year: 2020
  ident: br0260
  article-title: SIGNAL V4-INRIA version: reference manual
– volume: 79
  start-page: 1305
  year: 1991
  end-page: 1320
  ident: br0310
  article-title: The synchronous dataflow programming language
  publication-title: Proc. IEEE
– volume: 10
  start-page: 37
  year: 2016
  end-page: 53
  ident: br0540
  article-title: Towards a verified compiler prototype for the synchronous language SIGNAL
  publication-title: Front. Comput. Sci.
– year: 2014
  ident: br0370
  publication-title: System Design, Modeling, and Simulation Using Ptolemy II
– volume: 25
  start-page: 267
  year: 1983
  end-page: 310
  ident: br0130
  article-title: Calculi for synchrony and asynchrony
  publication-title: Theor. Comput. Sci.
– year: 1997
  ident: br0430
  article-title: Implementation of process networks in Java
– year: Jan. 2008
  ident: br0240
  article-title: Génération de code asynchrone dans un environnement polychrone pour la production de systèmes GALS
– volume: 91
  year: 2003
  ident: br0080
  article-title: The synchronous languages twelve years later
  publication-title: Special Issue on Modeling and Design of Embedded Systems
– year: 2009
  ident: br0110
  article-title: Designing Embedded Systems with the SIGNAL Programming Language
– start-page: 76
  year: 1985
  end-page: 95
  ident: br0120
  article-title: Process algebra with asynchronous communication mechanisms
  publication-title: Seminar on Concurrency
– year: 1985
  ident: br0010
  article-title: Communicating Sequential Processes
– volume: 98
  start-page: 99
  year: 1992
  end-page: 131
  ident: br0300
  article-title: The expressive power of indeterminate dataflow primitives
  publication-title: Inf. Comput.
– start-page: 46
  year: 2009
  end-page: 60
  ident: br0380
  article-title: Actors without directors: a Kahnian view of heterogeneous systems
  publication-title: HSCC ‘09: Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
– volume: 60
  start-page: 109
  year: 1984
  end-page: 137
  ident: br0030
  article-title: Process algebra for synchronous communication
  publication-title: Inf. Control
– year: 1998
  ident: br0440
  article-title: Process networks in Ptolemy II
– volume: 77
  start-page: 113
  year: 2012
  end-page: 128
  ident: br0250
  article-title: Compositional design of isochronous systems
  publication-title: Sci. Comput. Program.
– volume: vol. 1633
  start-page: 123
  year: 1999
  end-page: 133
  ident: br0230
  article-title: Latency insensitive protocols
  publication-title: Computer Aided Verification, 11th International Conference, CAV ’99
– volume: 12
  start-page: 261
  year: 2003
  end-page: 304
  ident: br0100
  article-title: Polychrony for system design
  publication-title: J. Circuits Syst. Comput.
– volume: 94
  start-page: 125
  year: 1992
  end-page: 140
  ident: br0150
  article-title: Clocks in dataflow languages
  publication-title: Theor. Comput. Sci.
– year: Sep. 1992
  ident: br0500
  article-title: Compilation de SIGNAL: horloges, dépendances, environnement
– start-page: 1
  year: 2010
  end-page: 40
  ident: br0530
  article-title: Compilation of polychronous data flow equations
  publication-title: Synthesis of Embedded Software
– volume: vol. 1
  start-page: 429
  year: 1993
  end-page: 432
  ident: br0410
  article-title: Scheduling Dynamic Dataflow Graphs with Bounded Memory Using the Token Flow Model
  publication-title: Proc. of IEEE International Conference on Acoustics, Speech, and Signal Processing
– start-page: 252
  year: 2002
  ident: 10.1016/j.scico.2023.102958_br0510
  article-title: A protocol for loosely time-triggered architectures
– start-page: 967
  year: 2010
  ident: 10.1016/j.scico.2023.102958_br0270
  article-title: Kahn process networks and a reactive extension
– year: 2003
  ident: 10.1016/j.scico.2023.102958_br0360
– volume: 12
  start-page: 261
  issue: 3
  year: 2003
  ident: 10.1016/j.scico.2023.102958_br0100
  article-title: Polychrony for system design
  publication-title: J. Circuits Syst. Comput.
  doi: 10.1142/S0218126603000763
– start-page: 124
  year: 1995
  ident: 10.1016/j.scico.2023.102958_br0290
  article-title: The expressive power of indeterminate primitives in asynchronous computation
– volume: 25
  start-page: 267
  issue: 3
  year: 1983
  ident: 10.1016/j.scico.2023.102958_br0130
  article-title: Calculi for synchrony and asynchrony
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/0304-3975(83)90114-7
– year: 1992
  ident: 10.1016/j.scico.2023.102958_br0500
– volume: 79
  start-page: 1305
  issue: 9
  year: 1991
  ident: 10.1016/j.scico.2023.102958_br0310
  article-title: The synchronous dataflow programming language Lustre
  publication-title: Proc. IEEE
  doi: 10.1109/5.97300
– volume: 10
  start-page: 37
  issue: 1
  year: 2016
  ident: 10.1016/j.scico.2023.102958_br0540
  article-title: Towards a verified compiler prototype for the synchronous language SIGNAL
  publication-title: Front. Comput. Sci.
  doi: 10.1007/s11704-015-4364-y
– year: 2008
  ident: 10.1016/j.scico.2023.102958_br0240
– volume: 17
  start-page: 1217
  year: 1998
  ident: 10.1016/j.scico.2023.102958_br0390
  article-title: A framework for comparing models of computation
  publication-title: IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.
  doi: 10.1109/43.736561
– start-page: 471
  year: 1974
  ident: 10.1016/j.scico.2023.102958_br0060
  article-title: The semantics of a simple language for parallel programming
– start-page: 252
  year: 1981
  ident: 10.1016/j.scico.2023.102958_br0280
  article-title: Scenarios: a model of non-determinate computation
– volume: 207
  year: 2021
  ident: 10.1016/j.scico.2023.102958_br0550
  article-title: Multi-task Ada code generation from synchronous dataflow programs on multi-core: approach and industrial study
  publication-title: Sci. Comput. Program.
  doi: 10.1016/j.scico.2021.102644
– volume: 100
  start-page: 1
  issue: 1
  year: 1992
  ident: 10.1016/j.scico.2023.102958_br0040
  article-title: A calculus of mobile processes (parts I and II)
  publication-title: Inf. Comput.
  doi: 10.1016/0890-5401(92)90008-4
– start-page: 180
  year: 2006
  ident: 10.1016/j.scico.2023.102958_br0470
  article-title: N-synchronous Kahn networks: a relaxed model of synchrony for real-time systems
– volume: 31
  start-page: 226
  issue: 6
  year: 1996
  ident: 10.1016/j.scico.2023.102958_br0330
  article-title: Synchronous Kahn networks
  publication-title: SIGPLAN Not.
  doi: 10.1145/232629.232651
– volume: vol. 1633
  start-page: 123
  year: 1999
  ident: 10.1016/j.scico.2023.102958_br0230
  article-title: Latency insensitive protocols
– volume: 79
  start-page: 1321
  issue: 9
  year: 1991
  ident: 10.1016/j.scico.2023.102958_br0090
  article-title: Programming real-time applications with Signal
  publication-title: Proc. IEEE
  doi: 10.1109/5.97301
– year: 1995
  ident: 10.1016/j.scico.2023.102958_br0420
– start-page: 147
  year: 2010
  ident: 10.1016/j.scico.2023.102958_br0520
  article-title: A module language for typing SIGNAL programs by contracts
– start-page: 413
  year: 1991
  ident: 10.1016/j.scico.2023.102958_br0140
  article-title: Data-flow to von Neumann: the SIGNAL approach
– ident: 10.1016/j.scico.2023.102958_br0260
– year: 1998
  ident: 10.1016/j.scico.2023.102958_br0440
– start-page: 46
  year: 2009
  ident: 10.1016/j.scico.2023.102958_br0380
  article-title: Actors without directors: a Kahnian view of heterogeneous systems
– year: 1994
  ident: 10.1016/j.scico.2023.102958_br0490
– volume: 60
  start-page: 109
  issue: 1–3
  year: 1984
  ident: 10.1016/j.scico.2023.102958_br0030
  article-title: Process algebra for synchronous communication
  publication-title: Inf. Control
  doi: 10.1016/S0019-9958(84)80025-X
– year: 2014
  ident: 10.1016/j.scico.2023.102958_br0370
– volume: 98
  start-page: 99
  issue: 1
  year: 1992
  ident: 10.1016/j.scico.2023.102958_br0300
  article-title: The expressive power of indeterminate dataflow primitives
  publication-title: Inf. Comput.
  doi: 10.1016/0890-5401(92)90043-F
– volume: 96
  year: 2014
  ident: 10.1016/j.scico.2023.102958_br0560
  article-title: Constructive polychronous systems
  publication-title: Sci. Comput. Program.
  doi: 10.1016/j.scico.2014.04.009
– year: 1985
  ident: 10.1016/j.scico.2023.102958_br0010
– start-page: 282
  year: 2005
  ident: 10.1016/j.scico.2023.102958_br0190
  article-title: From multi-clocked synchronous processes to latency-insensitive modules
– volume: 28
  start-page: 111
  issue: 2
  year: 2006
  ident: 10.1016/j.scico.2023.102958_br0200
  article-title: Concurrency in synchronous systems
  publication-title: Form. Methods Syst. Des.
  doi: 10.1007/s10703-006-7844-8
– volume: vol. 1
  start-page: 429
  year: 1993
  ident: 10.1016/j.scico.2023.102958_br0410
  article-title: Scheduling Dynamic Dataflow Graphs with Bounded Memory Using the Token Flow Model
– start-page: 1
  year: 2010
  ident: 10.1016/j.scico.2023.102958_br0530
  article-title: Compilation of polychronous data flow equations
– start-page: 42
  year: 2009
  ident: 10.1016/j.scico.2023.102958_br0220
  article-title: From concurrent multiclock programs to deterministic asynchronous implementations
– volume: 409
  start-page: 110
  issue: 1
  year: 2008
  ident: 10.1016/j.scico.2023.102958_br0400
  article-title: CPO semantics of timed interactive actor networks
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2008.08.044
– year: 2009
  ident: 10.1016/j.scico.2023.102958_br0110
– year: 1997
  ident: 10.1016/j.scico.2023.102958_br0430
– volume: 79
  start-page: 1270
  issue: 9
  year: 1991
  ident: 10.1016/j.scico.2023.102958_br0070
  article-title: The synchronous approach to reactive and real-time systems
  publication-title: Proc. IEEE
  doi: 10.1109/5.97297
– volume: vol. 966
  start-page: 15
  year: 1995
  ident: 10.1016/j.scico.2023.102958_br0160
  article-title: Execution of distributed reactive systems
– volume: 78
  start-page: 131
  issue: 1
  year: 2007
  ident: 10.1016/j.scico.2023.102958_br0210
  article-title: Correct-by-construction asynchronous implementation of modular synchronous specifications
  publication-title: Fundam. Inform.
– volume: 91
  issue: 1
  year: 2003
  ident: 10.1016/j.scico.2023.102958_br0080
  article-title: The synchronous languages twelve years later
  publication-title: Proc. IEEE
  doi: 10.1109/JPROC.2002.805826
– start-page: 402
  year: 2000
  ident: 10.1016/j.scico.2023.102958_br0450
  article-title: YAPI: application modeling for signal processing systems
– start-page: 237
  year: 2008
  ident: 10.1016/j.scico.2023.102958_br0480
  article-title: Abstraction of clocks in synchronous data-flow systems
– volume: 77
  start-page: 113
  issue: 2
  year: 2012
  ident: 10.1016/j.scico.2023.102958_br0250
  article-title: Compositional design of isochronous systems
  publication-title: Sci. Comput. Program.
  doi: 10.1016/j.scico.2010.06.006
– year: 1980
  ident: 10.1016/j.scico.2023.102958_br0020
– start-page: 76
  year: 1985
  ident: 10.1016/j.scico.2023.102958_br0120
  article-title: Process algebra with asynchronous communication mechanisms
– start-page: 319
  year: 2003
  ident: 10.1016/j.scico.2023.102958_br0460
  article-title: Requirements on the execution of Kahn process networks
– volume: 83
  start-page: 773
  issue: 5
  year: 1995
  ident: 10.1016/j.scico.2023.102958_br0050
  article-title: Dataflow process networks
  publication-title: Proc. IEEE
  doi: 10.1109/5.381846
– start-page: 45
  year: 1984
  ident: 10.1016/j.scico.2023.102958_br0340
  article-title: Listlessness is better than laziness: lazy evaluation and garbage collection at compile-time
– volume: 17
  start-page: 135
  issue: 2
  year: 2000
  ident: 10.1016/j.scico.2023.102958_br0170
  article-title: An implementation of constructive synchronous programs in POLIS
  publication-title: Form. Methods Syst. Des.
  doi: 10.1023/A:1008796718837
– volume: 163
  start-page: 125
  issue: 1
  year: 2000
  ident: 10.1016/j.scico.2023.102958_br0180
  article-title: Compositionality in dataflow synchronous languages: specification and distributed code generation
  publication-title: Inf. Comput.
  doi: 10.1006/inco.2000.9999
– volume: 94
  start-page: 125
  issue: 1
  year: 1992
  ident: 10.1016/j.scico.2023.102958_br0150
  article-title: Clocks in dataflow languages
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/0304-3975(92)90326-B
– start-page: 163
  year: 1995
  ident: 10.1016/j.scico.2023.102958_br0320
  article-title: Implementation of the data-flow synchronous language Signal
– volume: 36
  start-page: 24
  issue: 1
  year: 1987
  ident: 10.1016/j.scico.2023.102958_br0350
  article-title: Static scheduling of synchronous data flow programs for digital signal processing
  publication-title: IEEE Trans. Comput.
  doi: 10.1109/TC.1987.5009446
SSID ssj0006471
Score 2.3614244
Snippet In 1974, Gilles Khan defined a seminal semantic model for asynchronous dataflow programming that would then be called as the eponymous Kahn process networks...
In 1974, Gilles Kahn defined a seminal semantic model for asynchronous dataflow programming that would then be called as the eponymous Kahn process networks...
SourceID hal
crossref
elsevier
SourceType Open Access Repository
Enrichment Source
Index Database
Publisher
StartPage 102958
SubjectTerms Computer Science
Formal methods
Kahn process networks
Semantics of programming languages
Synchronous languages
Synchrony and asynchrony
Title The polychronous model of computation and Kahn process networks
URI https://dx.doi.org/10.1016/j.scico.2023.102958
https://inria.hal.science/hal-04216543
Volume 228
WOSCitedRecordID wos001001592000001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1872-7964
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0006471
  issn: 0167-6423
  databaseCode: AIEXJ
  dateStart: 20211213
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LT9wwELYW6KGXQl8qpVRW1VsblDgPO6dqW4Fou0IcqLS3yHFsAVqSVfYhfn7HryQFdQUHLtEqime9mc_2zOw3Mwh9VmUWJjxiQSgECZI8CYOcSh7QmOiMPXC3M2WaTdCzMzad5uej0crnwqxntK7Z7W0-f1JVwz1Qtk6dfYS6O6FwAz6D0uEKaofrgxU_b2awr7WNqb9qmt14-vjKsQt1vPw3vzQELZ0p8KW2fPDF0Fr1C78bK1tP6LrxR57m7nD4OU71urV2zyyeaAzKtr4Sd1mI3-Wi5pZWP2nMv_Unoo8izOauSZjkdXCuRcpheILEPY3KRyxhJwYnJx5uucQlhNtNE2yc3NZvv7ef29DCNXj6sC6OtPyj_ul_q2ffOdU6rqGnsV0XRkihhRRWyBbaITTNYT_fGf88nv7qjvDMeurd3H25KkMMvDeX_5k0W5c-OG-MlYs99MJ5GXhs0fESjWT9Cu36Dh7Y6fU1-gZgwUOwYAMW3Cg8AAsGsGANFuzAgj1Y3qA_J8cXP04D11IjEDEjy0CEmaAVFbkiYIdQVoE5Dg59GSow9WmeKpLzirKMwspViSqjSKVCZAlTLOKUq_gt2q6bWr5DOA7LVMoyLpNKJEIoxklUpYyoCrxuztJ9RPxbKYSrN6_bnsyKDRrZR1-7QXNbbmXz45l_3YWzGK0lWACANg_8BMrpvkLXWD8dTwp9D04xneEXr6P3j5vMAXreL4APaHvZruQheibWy6tF-9FB7C9GU5hm
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=The+polychronous+model+of+computation+and+Kahn+process+networks&rft.jtitle=Science+of+computer+programming&rft.au=Gautier%2C+Thierry&rft.au=Le+Guernic%2C+Paul&rft.au=Besnard%2C+Lo%C3%AFc&rft.au=Talpin%2C+Jean-Pierre&rft.date=2023-06-01&rft.issn=0167-6423&rft.volume=228&rft.spage=102958&rft_id=info:doi/10.1016%2Fj.scico.2023.102958&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_scico_2023_102958
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0167-6423&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0167-6423&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0167-6423&client=summon