Petri net verification techniques on Synchronous Dataflow models

Dataflow process networks lead to different theoretical model approaches and have demonstrated their adequacy in data-dominated intensive systems, namely Synchronous Dataflow. The paper presents a set of translating mechanisms allowing the mapping from dataflow models (Synchrounous Dataflows) into Petri nets. Study on invariants focused on misbehaving dataflow, in which there is no static scheduling are delved to find out more hidden embedded features not normally addressed in dataflow analysis tools. This scheme allows one to make conclusion in Petri net domain to be applied in dataflow models to foresee the necessary amount of storage resources for each are, as well as to unveil the effective maximum number of tokens and the potential maximum number of tokens for each Synchronous Dataflow. Dataflow model translation into Petri net domain will give support to attain the required resource allocation under a reduced (minor) dataflow where a static scheduling list still exists. An application example will be used to illustrate the concept and effectiveness of the outlined approach. Our focus in this paper is centered in the description, model validation and at property verification in Petri net domain, namely Invariant and reachability analysis.

[1]  Edward A. Lee,et al.  Heterogeneous Concurrent Modeling and Design in Java (Volume 3: Ptolemy II Domains) , 2008 .

[2]  To-Yat Cheung,et al.  Petri nets for protocol engineering , 1996, Comput. Commun..

[3]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[4]  Edward A. Lee,et al.  THE TOKEN FLOW MODEL , 2011 .

[5]  James Lyle Peterson,et al.  Petri net theory and the modeling of systems , 1981 .

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

[7]  Ed F. Deprettere,et al.  Context-aware process networks , 2003, Proceedings IEEE International Conference on Application-Specific Systems, Architectures, and Processors. ASAP 2003.

[8]  Luís Gomes,et al.  Models of Computation for Embedded Systems , 2005, The Industrial Information Technology Handbook.

[9]  Edward A. Lee,et al.  Scheduling dynamic dataflow graphs with bounded memory using the token flow model , 1993, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[10]  R. Karp,et al.  Properties of a model for parallel computations: determinacy , 1966 .

[11]  Jack B. Dennis,et al.  A preliminary architecture for a basic data-flow processor , 1974, ISCA '98.

[12]  Rüdiger Valk,et al.  Petri nets for systems engineering - a guide to modeling, verification, and applications , 2010 .

[13]  Luis Gomes,et al.  Dataflow model property verification using Petri net translation techniques , 2011, 2011 9th IEEE International Conference on Industrial Informatics.