Context-aware process networks

In industry, embedded systems for stream-based processing are often modelled and verified by using process networks, such as Kahn process networks. An advantage of Kahn networks is that they allow asynchronous operation of process components in a network. A problem in these networks, however, is that asynchronously interfering events cannot be handled properly because they are intrinsically indeterminate and therefore destroy the compositional properties of the network. We propose to extend the Kahn model of computations with a simple indeterminate construct. We call the resulting network a context-aware process network (CAPN). We show that these networks are capable of handling certain classes of events and can still be reduced to a class of parametrised Kahn networks.

[1]  James R. Russell,et al.  Full abstraction for nondeterministic dataflow networks , 1989, 30th Annual Symposium on Foundations of Computer Science.

[2]  Ieee Circuits,et al.  IEEE Transactions on Very Large Scale Integration (VLSI) Systems , 2018, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[3]  Gilles Kahn,et al.  The Semantics of a Simple Language for Parallel Programming , 1974, IFIP Congress.

[4]  E.A. Lee,et al.  Synchronous data flow , 1987, Proceedings of the IEEE.

[5]  Jean A. Peperstraete,et al.  Cycle-static dataflow , 1996, IEEE Trans. Signal Process..

[6]  Prakash Panangaden,et al.  The Expressive Power of Indeterminate Primitives in Asynchronous Computation , 1995, FSTTCS.

[7]  Prakash Panangaden,et al.  The Expressive Power of Indeterminate Dataflow Primitives , 1992, Inf. Comput..

[8]  Edward A. Lee,et al.  Synthesis of Embedded Software from Synchronous Dataflow Specifications , 1999, J. VLSI Signal Process..

[9]  Shuvra S. Bhattacharyya,et al.  Parameterized dataflow modeling for DSP systems , 2001, IEEE Trans. Signal Process..

[10]  William B. Ackerman,et al.  Scenarios: A Model of Non-Determinate Computation , 1981, ICFPC.

[11]  Stephen A. Edwards,et al.  Design of embedded systems: formal models, validation, and synthesis , 1997, Proc. IEEE.

[12]  Bart Kienhuis,et al.  Design space exploration of stream-based dataflow architectures: methods and tools , 1999 .

[13]  Prakash Panangaden,et al.  Computations, Residuals, and the POwer of Indeterminancy , 1988, ICALP.

[14]  Ed F. Deprettere,et al.  Algorithmic transformation techniques for efficient exploration of alternative application instances , 2002, Proceedings of the Tenth International Symposium on Hardware/Software Codesign. CODES 2002 (IEEE Cat. No.02TH8627).

[15]  Prakash Panangaden McCarthy's Amb Cannot Implement Fair Merge , 1988, FSTTCS.

[16]  Edward A. Lee,et al.  Advances in the dataflow computational model , 1999, Parallel Comput..

[17]  Jürgen Teich,et al.  SPI - a system model for heterogeneously specified embedded systems , 2002, IEEE Trans. Very Large Scale Integr. Syst..

[18]  Ed F. Deprettere,et al.  A Methodology for Architecture Exploration of Heterogeneous Signal Processing Systems , 2001, J. VLSI Signal Process..

[19]  Erwin A. de Kock,et al.  YAPI: application modeling for signal processing systems , 2000, Proceedings 37th Design Automation Conference.

[20]  Soonhoi Ha,et al.  Extended Synchronous Dataflow for Efficient DSP System Prototyping , 2002, Des. Autom. Embed. Syst..

[21]  James R. Russell,et al.  On oraclizable networks and Kahn's principle , 1989, POPL '90.

[22]  Jürgen Teich,et al.  FunState —an internal design representation for codesign , 1999, ICCAD 1999.

[23]  Gerard J. Holzmann,et al.  The Model Checker SPIN , 1997, IEEE Trans. Software Eng..