|
| | | |
Lightweight Consistency Analysis of Dataflow Process Networks
Jin, Y., Esser, R. and Lakos, C.
Process networks are a popular modelling technique for distributed computing an signal processing applications. The ability to support various parallelism or communication patterns also makes them suitable for modelling multi-processor architectures. At the architecture description level, the language provides the flexibility to model actual processes using various formalisms. This is especially import ant when the systems are comprised of parts with distinct characteristics, e.g. control-based or dataflow-oriented. However, this heterogeneity of processes poses a challenge for the consistency analysis of process networks. This research proposes a lightweight method for analysing the consistency of such networks. The method employees interface automata as a bridge between the architectural model and heterogeneous components representing concrete models of processes. Utilising interface automata, consistency is determined by a series of small tasks at both the architectural level and the component level. This separation of concerns simplifies the handling of heterogeneous components and alleviates the potential state space explosion problem when analysing large systems. |
Cite as: Jin, Y., Esser, R. and Lakos, C. (2003). Lightweight Consistency Analysis of Dataflow Process Networks. In Proc. Twenty-Sixth Australasian Computer Science Conference (ACSC2003), Adelaide, Australia. CRPIT, 16. Oudshoorn, M. J., Ed. ACS. 291-300. |
(from crpit.com)
(local if available)
|
|