This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Algebra of Connectors—Structuring Interaction in BIP
October 2008 (vol. 57 no. 10)
pp. 1315-1330
We provide an algebraic formalization of connectors in the BIP component framework. A connector relates a set of typed ports. Types are used to describe different modes of synchronization: rendezvous and broadcast, in particular. Connectors on a set of ports P are modeled as terms of the algebra AC(P), generated from P by using a binary fusion operator and a unary typing operator. Typing associates with terms (ports or connectors) synchronization types --- trigger or synchron --- that determine modes of synchronization. Broadcast interactions are initiated by triggers. Rendezvous is a maximal interaction of a connector including only synchrons. The semantics of AC(P) associates with a connector the set of its interactions. It induces on connectors an equivalence relation which is not a congruence as it is not stable for fusion. We provide a number of properties of AC(P) used to symbolically simplify and handle connectors. We provide examples illustrating applications of AC(P), including a general component model encompassing synchrony, methods for incremental model decomposition, and efficient implementation by using symbolic techniques.

[1] M. Bernardo, P. Ciancarini, and L. Donatiello, “On the Formalization of Architectural Types with Process Algebras,” Proc. ACM SIGSOFT Symp. Foundations of Software Eng. (SIGSOFT FSE '00), pp. 140-148, 2000.
[2] B. Spitznagel and D. Garlan, “A Compositional Formalization of Connector Wrappers,” Proc. Int'l Conf. Software Eng. (ICSE '03), pp. 374-384, 2003.
[3] J.L. Fiadeiro, Categories for Software Eng. Springer-Verlag, Apr. 2004.
[4] R. Bruni, I. Lanese, and U. Montanari, “A Basic Algebra of Stateless Connectors,” Theoretical Computer Science, vol. 366, no. 1, pp. 98-120, 2006.
[5] F. Arbab, “Reo: A Channel-Based Coordination Model for Component Composition,” Math. Structures in Computer Science, vol. 14, no. 3, pp. 329-366, 2004.
[6] A. Basu, M. Bozga, and J. Sifakis, “Modeling Heterogeneous Real-Time Components in BIP,” Proc. Fourth IEEE Int'l Conf. Software Eng. and Formal Methods (SEFM '06), pp. 3-12, Sept. 2006.
[7] J. Sifakis, “A Framework for Component-Based Construction,” Proc. Third IEEE Int'l Conf. Software Eng. and Formal Methods (SEFM '05), keynote talk, pp. 293-300, Sept. 2005.
[8] G. Gößler and J. Sifakis, “Component-Based Construction of Deadlock-Free Systems: Extended Abstract,” Proc. 23rd Int'l Conf. Foundations of Software Technology and Theoretical Computer Science (FSTTCS '03), P.K. Pandya and J. Radhakrishnan, eds., pp. 420-433, Dec. 2003.
[9] G. Gößler and J. Sifakis, “Composition for Component-Based Modeling,” Science of Computer Programming, vol. 55, nos. 1-3, pp.161-183, 2005.
[10] “BIP,” http://www-verimag.imag.fr/~asyncindex.php?view= components . 2008.
[11] F. Maraninchi and Y. Rémond, “Argos: An Automaton-Based Synchronous Language,” Computer Languages, vol. 27, pp. 61-92, 2001.
[12] C.A.R. Hoare, Communicating Sequential Processes, Prentice Hall, Apr. 1985.
[13] R. Milner, Communication and Concurrency, Prentice Hall, 1989.
[14] A.W. Roscoe, Theory and Practice of Concurrency. Prentice Hall, 1997.
[15] “C$\omega$ ,” http://research.microsoft.comcomega/, 2008.
[16] “nesC: A Programming Language for Deeply Networked Systems,” http:/nescc.sourceforge.net/, 2008.
[17] G. Berry and G. Gonthier, “The esterel Synchronous Programming Language: Design, Semantics Implementation,” Science of Computer Programming, vol. 19, no. 2, pp. 87-152, Nov. 1992.
[18] N. Halbwachs, P. Caspi, P. Raymond, and D. Pilaud, “The Synchronous Dataflow Programming Language lustre,” Proc. IEEE, vol. 79, pp. 1305-1320, Sept. 1991.
[19] S. Bliudze and J. Sifakis, “The Algebra of Connectors—Structuring Interaction in BIP,” Technical Report TR-2007-3, VERIMAG, http://www-verimag.imag.frindex.php?page=techrep-list , 2007.
[20] A. Basu, L. Mounier, M. Poulhiès, J. Pulou, and J. Sifakis, “Using BIP for Modeling and Verification of Networked Systems—A Case Study on TinyOS-Based Networks,” Technical Report TR-2007-5, VERIMAG, http://www-verimag.imag.frindex.php? page=techrep-list , 2007.

Index Terms:
Real-time and embedded systems, System architectures, integration and modeling, Systems specification methodology, Interconnections (Subsystems), Architecture
Citation:
Simon Bliudze, Joseph Sifakis, "The Algebra of Connectors—Structuring Interaction in BIP," IEEE Transactions on Computers, vol. 57, no. 10, pp. 1315-1330, Oct. 2008, doi:10.1109/TC.2008.26
Usage of this product signifies your acceptance of the Terms of Use.