Improving Synchronous Dataflow Analysis Supported by Petri Net Mappings

Abstract

Whereas most of the work that analyses Synchronous Dataflow (SDF) stays in the dataflow framework, this work pushes its analysis into another framework level, thereby addressing issues that are not well addressed or are even unexplored in SDF. In this manner, the paper proposes a model-driven engineering (MDE) method, combining Synchronous Dataflow (SDF) and Petri nets, to highlight and reinforce their interoperability in digital signal processing applications, cyber-physical systems, or industrial applications. Improvements regarding the settlement and exploitation of the initial conditions associated with SDF are demonstrated; this issue is crucial for every cyber-physical system, since a system’s initial conditions are crucial to ensuring the system’s liveness. The improvements outlined in this work exploit an innovating mapping in the Place/Transition (P/T) Petri net domain that is intended to reduce and predict the total amount of initial data in SDF channels. The relevance of the firing semantics engaged with the equivalent Petri net model is discussed. This paper proposes a new approach to estimate whether an SDF has a static schedule by performing simulation and property verification of the equivalent-based P/T Petri net system achieved, framed by a Petri net invariant analysis and based on the stubborn set method of Petri nets. In this way, this new approach will allow mitigating the state explosion problem. Finally, a strategy is applied to two case studies to discover all the elementary circuits (static schedules) associated with the generated model’s state-space.

Balancing Static Islands in Dynamically Scheduled Circuits Using Continuous Petri Nets

“…Modelling hardware behaviours using Petri nets has been investigated for decades [33], [34]. These works all use discrete Petri nets for analysing synchronous or asynchronous hardware, while we use TCPN+i for analysing synchronous hardware.…”

Path Planning of Multi-Type Robot Systems with Time Windows Based on Timed Colored Petri Nets

“…requires that the task in region r 1 can only be performed by a C 1 robot in the time window [2,5]; the task in region r 8 should be performed by two types of robot, i.e., C 1 and C 2 ; the task in region r 10 can be performed by any type of robot in time window [20,30]; and all robots should avoid region r 7 .…”

“…In an MRS, the system's environment was divided into zones, and the movement of any robot from one zone to another was treated as a discrete event [20][21][22][23]. Petri nets(PNs) are an efficient tool to model, analyze, and control discrete event systems [24][25][26][27][28][29][30][31], such as robotics and intelligent transportation. PN can effectively avoid the state explosion problem as the number of robots increases.…”

Challenges in Application of Petri Nets in Manufacturing Systems

“…Going somewhat beyond CPSs into the domain of power engineering, PNs can also be used for specification of control algorithm of matrix converters [46], formally verified with symbolic model checking and rule-based logical model [12] and implemented in an FPGA device. Other approaches combine PNs with synchronous dataflow (SDF) [47] to reduce and predict the total amount of initial data SDF channels. Coloured PNs can be applied in design of multi resident smart home data generator [48] or for maintainability evaluation [49].…”