×

zbMATH — the first resource for mathematics

A general framework for architecture composability. (English) Zbl 1342.68029
Summary: Architectures depict design principles: paradigms that can be understood by all, allow thinking on a higher plane and avoiding low-level mistakes. They provide means for ensuring correctness by construction by enforcing global properties characterizing the coordination between components. An architecture can be considered as an operator \(A\) that, applied to a set of components \(\mathcal{B}\), builds a composite component \(A(\mathcal{B})\) meeting a characteristic property \(\Phi\). Architecture composability is a basic and common problem faced by system designers. In this paper, we propose a formal and general framework for architecture composability based on an associative, commutative and idempotent architecture composition operator \(\oplus\). The main result is that if two architectures \(A_{1}\) and \(A_{2}\) enforce respectively safety properties \(\Phi_{1}\) and \(\Phi_{2}\), the architecture \(A_{1} \oplus A_{2}\) enforces the property \(\Phi_{1} \land \Phi_{2}\), that is both properties are preserved by architecture composition. We also establish preservation of liveness properties by architecture composition. The presented results are illustrated by a running example and a case study.

MSC:
68M07 Mathematical problems of computer architecture
68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Software:
Ptolemy; Reo; Metropolis
PDF BibTeX Cite
Full Text: DOI
References:
[1] Attie PC, Bensalem S, Bozga M, Jaber M, Sifakis J, Zaraket FA (2013) An abstract framework for deadlock prevention in BIP. In: FMOODS/FORTE, pp 161-177
[2] Attie, P; Baranov, E; Bliudze, S; Jaber, M; Sifakis, J; Giannakopoulou, D (ed.); Salaün, G (ed.), A general framework for architecture composability, 128-143, (2014), Switzerland
[3] Attie PC, Baranov E, Bliudze S, Jaber M, Sifakis J (2014) A general framework for architecture composability. Technical Report EPFL-REPORT-196536, EPFL IC IIF RiSD. http://infoscience.epfl.ch/record/196536 · Zbl 1342.68029
[4] Abadi, M; Leslie, L, Composing specifications, ACM Trans Program Lang Syst, 15, 73-132, (1993)
[5] Arbab, F, Reo: a channel-based coordination model for component composition, Math Struct Comput Sci, 14, 329-366, (2004) · Zbl 1085.68552
[6] Basu, A; Bensalem, S; Bozga, M; Combaz, J; Jaber, M; Nguyen, T-H; Sifakis, J, Rigorous component-based system design using the BIP framework, Softw IEEE, 28, 41-48, (2011)
[7] Bernardo M, Ciancarini P, Donatiello L (2000) On the formalization of architectural types with process algebras. In: SIGSOFT FSE, pp 140-148
[8] Balasubramanian, K; Gokhale, AS; Karsai, G; Sztipanovits, J; Neema, S, Developing applications using model-driven design environments, IEEE Comput, 39, 33-40, (2006)
[9] Bruni, R; Lanese, I; Montanari, U, A basic algebra of stateless connectors, Theor Comput Sci, 366, 98-120, (2006) · Zbl 1153.68331
[10] Bliudze S, Sifakis J (2007) The algebra of connectors—structuring interaction in BIP. In: Proceedings of the EMSOFT’07, Salzburg. ACM SigBED, pp 11-20 · Zbl 1390.68031
[11] Bliudze, S; Sifakis, J, Causal semantics for the algebra of connectors, Formal Methods Syst Des, 36, 167-194, (2010) · Zbl 1207.68203
[12] Bliudze, S; Sifakis, J; Sven, A (ed.); Ethan, J (ed.), Synthesizing glue operators from glue constraints for the construction of component-based systems, 51-67, (2011), Berlin/Heidelberg
[13] Balarin, F; Watanabe, Y; Hsieh, H; Lavagno, L; Passerone, C; Sangiovanni-Vincentelli, A, Metropolis: an integrated electronic system design environment, IEEE Comput, 36, 45-52, (2003)
[14] Calder, M; Kolberg, M; Magill, EH; Reiff-Marganiec, S, Feature interaction: a critical review and considered forecast, Comput Netw, 41, 115-141, (2003) · Zbl 1047.68502
[15] D’Souza D, Gopinathan M (2008) Conflict-tolerant features. In: CAV, LNCS, vol 5123. Springer, pp 227-239 · Zbl 1155.68432
[16] Decker G, Puhlmann F, Weske M (2006) Formalizing service interactions. In: Business process management, pp 414-419 · Zbl 1207.68203
[17] Eker, J; Janneck, JW; Lee, EA; Liu, J; Liu, X; Ludvig, J; Neuendorffer, S; Sachs, S; Xiong, Y, Taming heterogeneity: the Ptolemy approach, Proc IEEE, 91, 127-144, (2003)
[18] Francez N, Forman IR (1996) Interacting processes: a multiparty approach to coordinated distributed programming. ACM Press/Addison-Wesley Publishing Co., New York · Zbl 0851.68031
[19] Fiadeiro JL (2004) Categories for Software Engineering. Springer-Verlag · Zbl 0983.68236
[20] Hay, JD; Atlee, JM, Composing features and resolving interactions, SIGSOFT Softw Eng Notes, 25, 110-119, (2000)
[21] Hoare CAR (1985) Communicating sequential processes. Prentice Hall International Series in Computer Science. Prentice Hall
[22] Liskov B, Guttag J (2000) Program development in java. Addison Wesley · Zbl 0644.68001
[23] Li Z, Jin Y, Han J (2006) A runtime monitoring and validation framework for web service interactions. In: ASWEC, pp 70-79
[24] Liu I, Reineke J, Lee EA (2010) A PRET architecture supporting concurrent programs with composable timing properties. In: Signals, systems and computers (ASILOMAR), 2010 Conference record of the forty fourth asilomar conference, pp 2111-2115 · Zbl 1047.68502
[25] Milner R (1989) Communication and concurrency. Prentice Hall International Series in Computer Science, Prentice Hall · Zbl 0683.68008
[26] Plath, M; Ryan, M, Feature integration using a feature construct, Sci Comput Programm, 41, 53-84, (2001) · Zbl 0983.68236
[27] Ray A, Cleaveland R (2003) Architectural interaction diagrams: AIDs for system modeling. In: ICSE’03: Proceedings of the 25th international conference on software engineering, Washington, DC. IEEE Computer Society, pp 396-406
[28] Spitznagel B, Garlan D (2003) A compositional formalization of connector wrappers. In: ICSE. IEEE Computer Society, pp 374-384 · Zbl 0251.05107
[29] Sifakis J (2012) Rigorous system design. Found Trends Electron Des Autom 6(4):293-362, 2012 · Zbl 0251.05107
[30] Tarjan, R, Depth-first search and linear graph algorithms, SIAM J Comput, 1, 146-160, (1972) · Zbl 0251.05107
[31] Wegner P (1996) Coordination as constrained interaction (extended abstract). In: Coordination languages and models, LNCS, vol 1061. Springer, pp 28-33
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.