The well established modeling techniques and analysis methods defined in the Petri net framework developed through a half century by the scientific community allows to infer and state reliableness conclusions about other Models of Computation (MoC), as long as one can trace or discover links between them. This type of relationship mappings are crucial to strengthen and enlighten hidden issues normally not addressed in one of the engaged mapping domain. A semi-formal method (S-FM) design encompassing well ordered chain dataflows and Petri nets is presented. Also as a contribution, an extension to the S-FM is given for chain ordered dataflow with feedback actors. By adopting the S-FM strategy the designer will be able to envision the maximum amount of storage resource allocated inside every static scheduling lists, taking a reduced state space generated in Petri net framework. To exemplify the effectiveness and verification methodology of S-FM analysis a signal processing application case study is shown.