ACM Home Page
Please provide us with feedback. Feedback
The algebra of connectors: structuring interaction in BIP
Full text PdfPdf (249 KB)
Source
International Conference On Embedded Software archive
Proceedings of the 7th ACM & IEEE international conference on Embedded software table of contents
Salzburg, Austria
SESSION: Formal methods table of contents
Pages: 11 - 20  
Year of Publication: 2007
ISBN:978-1-59593-825-1
Authors
Simon Bliudze  VERIMAG, Gières, France
Joseph Sifakis  VERIMAG, Gières, France
Sponsors
ACM: Association for Computing Machinery
SIGBED: ACM Special Interest Group on Embedded Systems
SIGMICRO: ACM Special Interest Group on Microarchitectural Research and Processing
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 48,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1289927.1289935
What is a DOI?

ABSTRACT

We provide an algebraic formalisation of connectors in BIP. These are used to structure interactions in a component-based system. A connector relates a set of typed ports. Types are used to describe different modes of synchronisation: rendezvous and broadcast, in particular.

Connectors on a set of ports P are modelled 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) synchronisation types - trigger or synchron - , which determine modes of synchronisation. 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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
 
4
 
5
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, 2007. http://www-verimag.imag.fr/index.php?page=techrep-list.
 
6
A. Benveniste, P. Caspi, S. A. Edwards, N. Halbwachs, P. L. Guernic, and R. de Simone. The synchronous languages twelve years later. Proc. of the IEEE, Special Issue on Embedded Systems, 91(1):64--83, 2003.
7
 
8
BIP. http://www-verimag.imag.fr/~async/index.php?view=components.
 
9
S. Bliudze and J. Sifakis. The algebra of connectors - structuring interaction in BIP. Technical Report TR-2007-3, VERIMAG, 2007. http://www-verimag.imag.fr/index.php?page=techrep-list.
 
10
R. Bruni, J. L. Fiadeiro, I. Lanese, A. Lopes, and U. Montanari. New insights on architectural connectors. In J.-J. Lévy, E. W. Mayr, and J. C. Mitchell, editors, IFIP TCS, pages 367--380. Kluwer, 2004.
 
11
Cω. http://research.microsoft.com/comega/.
 
12
J. Eker, J. Janneck, E. Lee, J. Liu, X. Liu, J. Ludvig, S. Neuendorffer, S. Sachs, and Y. Xiong. Taming heterogeneity: The Ptolemy approach. Proceedings of the IEEE, 91(1):127--144, 2003.
 
13
 
14
G. Gö&@223;ler and J. Sifakis. Component-based construction of deadlock-free systems: Extended abstract. In P. K. Pandya and J. Radhakrishnan, editors, FSTTCS, volume 2914 of Lecture Notes in Computer Science, pages 420--433, Mumbai, India, Dec. 2003. Springer.
 
15
 
16
 
17
F. Maraninchi and Y. Rémond. Argos: an automaton-based synchronous language. Computer Languages, 27:61--92, 2001.
 
18
 
19
nesC: A programming language for deeply networked systems. http://nescc.sourceforge.net/.
 
20
 
21

Collaborative Colleagues:
Simon Bliudze: colleagues
Joseph Sifakis: colleagues