Abstract
Process networks are popular for modelling distributed computing and signal processing applications, and multi-processor architectures. At the architecture description level, they have the flexibility to model actual processes using various formalisms. This is especially important where the systems are composed of parts with different characteristics, e.g. control-based or dataflow-oriented. However, this heterogeneity of processes presents a challenge for the analysis of process networks. This research proposes a lightweight method for analysing properties of such networks, such as freedom from unexpected reception and deadlock. The method employs interface automata as a bridge between the architectural model and heterogeneous processes. Thus, the properties are determined by a series of small tasks at both the architecture level and the process level. This separation of concerns simplifies the handling of heterogeneous processes and alleviates the potential state space explosion problem when analysing large systems.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
M. Anlauff, P. Kutter, A. Pierantonio, and A. Sünbül. Using domain-specific languages for the realization of component composition. In Proc. of the Fundamental Approaches to Software Engineering (FASE 2000), LNCS 1783. Springer.
F. Bachman, L. Bass, C. Buhman, S. Comella-Dorda, F. Long, J. Robert, R. Seacord, and K. Wallnau. Volume II: Technical concepts of component-based software engineering. Technical Report CMU/SEI-2000-TR-008, 2000.
L. de Alfaro and T. Henzinger. Interface automata. In Proc. of the Foundation of Software Engeneering (FSE 2001), pages 109–122. ACM Press.
R. Esser and J. Janneck. Moses-a tool suite for visual modelling of discrete-event systems. In Symposium on Visual/Multimedia Approaches to Programming and Software Engineering, 2001.
P. Inverardi and S. Uchitel. Proving deadlock freedom in component-based programming. In Proc. of the Fundamental Approaches to Software Engineering (FASE 2001), LNCS 2029.
P. Inverardi, A. Wolf, and D. Yankelevich. Static checking of system behaviors using derived component assumptions. ACM Trans. on Software Engineering and Methodology, 9(3):239–272, 2000.
J. Janneck and R. Esser. Higher-order Petri Net modeling-techniques and applications. In Workshop on Softw. Eng. and Formal Methods of ICATPN 2002.
K. Jensen. Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use, volume 1 of Monographs in Theoretical Computer Science. Springer-Verlag, 1997.
Y. Jin, R. Esser, and J. Janneck. Describing the syntax and semantics of UML statecharts in a heterogeneous modelling environment. In Proc. of the Diagrammatic Representation and Inference (Diagrams 2002), LNAI 2317. Springer.
G. Kahn. The semantics of a simple language for parallel programming. In Proc. of the IFIP Congress 1974, pages 471–475. North-Holland Publishing Co.
R. Karp and R. Miller. Properties of a model for parallel computations: determinacy, termination, queuing. SIAM J. Appl. Math., 14:1390–1411, 1966.
E. Lee and T. Parks. Dataflow process networks. Proc. of the IEEE, 83(5):773–801, 1995.
S. Rajamani and J. Rehof. Conformance checking for models of asynchronous message passing software. In Proc. of the Computer-Aided Verification (CAV 2002), LNCS 2404. Springer.
W. Reisig and G. Rozenberg, editors. Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, LNCS 1491. Springer-Verlag, 1998.
D. Skillcorn. Stream languages and data-flow. In Advanced Topics in Data-Flow Computing. Prentice Hall, 1991.
S. Uchitel and D. Yankelevich. Enhancing architectural mismatch detection with assumptions. In Proc. of the Eng. of Computer Based Systems (ECBS 2000).
D. Yellin and R. Storm. Protocol specifications and component adaptors. ACM Trans. on Programming Languages and Systems, 19(2):292–333, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jin, Y., Esser, R., Lakos, C., Janneck, J.W. (2003). Modular Analysis of Dataflow Process Networks. In: Pezzè, M. (eds) Fundamental Approaches to Software Engineering. FASE 2003. Lecture Notes in Computer Science, vol 2621. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36578-8_14
Download citation
DOI: https://doi.org/10.1007/3-540-36578-8_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00899-6
Online ISBN: 978-3-540-36578-5
eBook Packages: Springer Book Archive