Skip to Main Content
We consider embedded systems structured as a graph of communicating components. In this model, we define a data matching property based upon the interactions of the data flow paths passing through common components. If a component uses inputs which indirectly depend on the same component output, these inputs have to depend on a same execution step of the producer component, even when several independent paths link these two components, and when the components have different timing characteristics (esp. different periods). We analyze the system architecture to detect situations that can cause data matching problems. Depending on the system needs, we propose several approaches to manage data matching.