Abstract:Abstract. This paper investigates the analysis of temporal properties of control systems modelled using the data ow computational paradigm. A transformation from data ow networks to timed Petri nets is de ned. It preserves temporal properties and allows, through the analysis of the Petri net, the indirect evaluation of the properties of the data ow network. The paper contains an example for explaining the transformation and showing which kind of analyses can be performed.
“…However, the proof of isomorphism first requires to define the type and exact semantics of data flow networks and then the class of the corresponding Petri nets. [5] introduces a transformation from DFN models to timed Petri nets of the class Deterministic and Stochastic Petri Nets [8]. [7] proves that the transformation preserves timing and reachability properties, thus the analysis of data flow networks can be performed on the equivalent Petri net.…”
“…However, the proof of isomorphism first requires to define the type and exact semantics of data flow networks and then the class of the corresponding Petri nets. [5] introduces a transformation from DFN models to timed Petri nets of the class Deterministic and Stochastic Petri Nets [8]. [7] proves that the transformation preserves timing and reachability properties, thus the analysis of data flow networks can be performed on the equivalent Petri net.…”
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.