A Generic Approach to Connector Architectures. Part II: Instantiation to Petri Nets and CSP

• Autorzy: Orejas F. , Klein M. , Pino E. , Ehrig H. , Padberg J. , Pérez S.
• Języki publikacji: EN

Abstrakty

EN

The aim of this paper is to show how the generic approach to connector architectures, presented in the first part of this work, can be applied to a given modeling formalism to define architectural component and connector notions associated to that formalism. Starting with a review of the generic approach, in this second part of the paper we consider two modeling formalisms: elementary Petri nets and CSP. As main results we show that both cases satisfy the axioms of our component framework, so that the results concerning the semantics of architectures can be applied. Moreover, a small case study in terms of Petri Nets is presented in order to show how the results can be applied to a connector architecture based on Petri nets.

Słowa kluczowe

EN

architectural connectors; formal software modelling; software architecture; Petri net; CSP

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2010
• Tom: Vol. 99, nr 1
• Strony: 95--124
• Opis fizyczny: Bibliogr. 28 poz. wykr.

Twórcy

autor

Orejas F.

autor

Klein M.

autor

Pino E.

autor

Ehrig H.

autor

Padberg J.

autor

Pérez S.

• Universitat Politécnica de Catalunya, Dept. LSI Campus Nord, Módul C5 08034 Barcelona, Spain

Bibliografia

• [1] R. Allen, D. Garlan. A Formal Basis for Architectural Connection. In ACM Trans. on Software Engineering and Methodology 6(3): 213-249, 1997.
• [2] N. Aoumeur, G. Saake. A component-based Petri net model for specifying and validating cooperative information systems. Data Knowl. Eng. 42(2): 143-187, 2002.
• [3] S. Balsamo, M. Bernardo, M. Simeoni. Performance evaluation at the software architecture level. In Formal Methods for Software Architecture, (Bernado, M. and Inveradi, P., eds.), volume 2804 of Lecture Notes in Computer Science, pages 207-258. Springer, 2003.
• [4] E. Battiston, F.D. Cindio, G. Mauri. OBJSA nets: a class of high-level nets having objects as domains. In G. Rozenberg (Ed.), Advances in Petri Nets, volume 340 of Lecture Notes in Computer Science, pages 20-43. Springer, 1988.
• [5] E. Battiston, F.D. Cindio, G. Mauri, L. Rapanotti. Morphisms and minimal models for OBJSA nets. In 12th International Conference on Application and Theory of Petri Nets, volume 524 of Lecture Notes in Computer Science, pages 455-476. Springer, 1991.
• [6] M. Bernardo, P. Ciancarini, Lorenzo Donatiello: Architecting families of software systems with process algebras. ACM Trans. Software Engineering and Methodology 11(4): 386-426, 2002.
• [7] M. Broy, T. Streicher. Modular functional modelling of Petri nets with individual tokens. In Advances in Petri Nets, volume 609 of Lecture Notes in Computer Science, pages 70-88. Springer, 1992.
• [8] P. Buchholz. Hierarchical high level Petri nets for complex system analysis. In Application and Theory of Petri Nets, volume 815 of Lecture Notes in Computer Science, pages 119-138. Springer, 1994.
• [9] S. Christinsen, N. Hansen. Coloured Petri nets extended with channels for synchronous communication. In Application and Theory of Petri Nets, volume 815 of Lecture Notes in Computer Science, pages 159-178. Springer, 1994.
• [10] W. Deiters, V. Gruhn. The FUNSOFT net approach to software process management. International Journal on Software Engineering and Knowledge Engineering 4(2): 229-256, 1994.
• [11] J. Desel, G. Juhs, R. Lorenz. Process semantics of Petri nets over partial algebra. In Proceedings of the XXI International Conference on Applications and Theory of Petri Nets, volume 1825 of Lecture Notes in Computer Science, pages 146-165. Springer, 2000.
• [12] H. Ehrig, K. Ehrig, U. Prange, G. Taentzer. Fundamentals of Algebraic Graph Transformation. EATCS Monographs in Theoretical Computer Science. Springer, 2006.
• [13] R. Fehling. A concept of hierarchical Petri nets with building blocks. In Advances in Petri Nets93, volume 674 of Lecture Notes in Computer Science, pages 148-168. Springer, 1993.
• [14] X. He. A formal definition of hierarchical predicate transition nets. In Application and Theory of Petri Nets, volume 1091 of Lecture Notes in Computer Science, pages 212-229. Springer, 1996.
• [15] J. F. Groote, M. Voorhoeve. Operational semantics for Petri net components. Theor. Comput. Sci. 379(1-2): 1-19, 2007.
• [16] C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
• [17] P. Inverardi, A. L. Wolf: Formal Specification and Analysis of Software Architectures Using the Chemical Abstract Machine Model. IEEE Trans. Software Engineering 21(4): 373-386, 1995.
• [18] K. Jensen. Coloured Petri nets. Basic concepts, analysis methods and practical use. EATCS Monographs in Theoretical Computer Science. Springer, 1992.
• [19] E. Kindler, Modularer Entwurf verteilter Systeme mit Petrinetzen, Ph.D. thesis, Technische Universität München, Institut für Informatik, 1995.
• [20] M. Klein, Transformation-Based Component Architectures - General Framework, Instantiations and Case Study. Ph.D. thesis, Technische Universität Berlin, 2006.
• [21] J. Magee, J. Kramer. Dynamic Structures in Software Architecture. In David Garlan (Ed.), Proc. 4th ACM SIGSOFT Symposium on the Foundations of Software Engineering, ACM SIGSOFT Software Engineering Notes 21(6): 3-14, 1996.
• [22] F. Oquendo: pi-ADL: an Architecture Description Language based on the higher-order typed pi-calculus for specifying dynamic and mobile software architectures. ACM SIGSOFT Software Engineering Notes 29(3): 1-14, 2004.
• [23] J. Padberg. Place/transition net modules: Transfer from specification modules. Forschungsbericht 2001/05, Fakultät IV - Elektrotechnik und Informatik, TU Berlin, 2001.
• [24] J. Padberg, H. Ehrig. Petri net modules in the transformation-based component framework. J. Log. Algebr. Program. 67(1-2): 198-225, 2006.
• [25] W. Reisig. Petri Nets. EATCS Monographs in Theoretical Computer Science. Springer, 1985.
• [26] C. Sibertin-Blanc. Cooperative nets. In Application and Theory of Petri Nets, volume 815 of Lecture Notes in Computer Science, pages 471-490. Springer, 1994.
• [27] F. L. Tiplea, A. Tiplea: Petri net reactive modules. Theor. Comput. Sci. 359 (1-3): 77-100, 2006.
• [28] M. Urbasek and J. Padberg. Preserving liveness with rule-based refinement of place/transition systems. In Proc. of Sixth World Conference on Integrated Design and Process Technology, Pasadena, USA, 2002.