Skip to main content
SpringerLink
Log in

Automata for Context-Dependent Connectors

  • Conference paper
Coordination Models and Languages (COORDINATION 2009)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5521))

Included in the following conference series:

Abstract

Recent approaches to component-based software engineering employ coordinating connectors to compose components into software systems. For maximum flexibility and reuse, such connectors can themselves be composed, resulting in an expressive calculus of connectors whose semantics encompasses complex combinations of synchronisation, mutual exclusion, non-deterministic choice and state-dependent behaviour. A more expressive notion of connector includes also context-dependent behaviour, namely, whenever the choices the connector can take change non-monotonically as the context, given by the pending activity on its ports, changes. Context dependency can express notions of priority and inhibition. Capturing context-dependent behaviour in formal models is non-trivial, as it is unclear how to propagate context information through composition. In this paper we present an intuitive automata-based formal model of context-dependent connectors, and argue that it is superior to previous attempts at such a model for the coordination language Reo.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arbab, F.: Reo: a channel-based coordination model for component composition. Mathematical Structures in Computer Science 14(3), 329–366 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  2. Arbab, F.: Abstract behavior types: a foundation model for components and their composition. Sci. Comput. Program. 55(1-3), 3–52 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  3. Arbab, F., Bruni, R., Clarke, D., Lanese, I., Montanari, U.: Tiles for Reo. In: WADT (2009) (to appear)

    Google Scholar 

  4. Arbab, F., Chothia, T., van der Mei, R., Meng, S., Moon, Y., Verhoef, C.: From Coordination to Stochastic Models of QoS. In: Field, J., Vasconcelos, V.T. (eds.) COORDINATION 2009. LNCS, vol. 5521, pp. 268–287. Springer, Heidelberg (2009)

    Google Scholar 

  5. Arbab, F., Herman, I., Spilling, P.: An overview of Manifold and its implementation. Concurrency - Practice and Experience 5(1), 23–70 (1993)

    Article  Google Scholar 

  6. Arbab, F., Rutten, J.: A coinductive calculus of component connectors. In: Wirsing, M., Pattinson, D., Hennicker, R. (eds.) WADT 2003. LNCS, vol. 2755, pp. 34–55. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  7. Baier, C., Sirjani, M., Arbab, F., Rutten, J.: Modeling component connectors in Reo by constraint automata. Sci. Comput. Program. 61(2), 75–113 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  8. Barbosa, L., Barbosa, M.: A perspective on service orchestration. In: Science of Computer Programming (2008) (accepted for publication)

    Google Scholar 

  9. Barbosa, M., Barbosa, L., Campos, J.: Towards a coordination model for interactive systems. Electr. Notes Theor. Comput. Sci. 183, 89–103 (2007)

    Article  Google Scholar 

  10. Clarke, D., Proença, J., Lazovik, A., Arbab, F.: Deconstructing Reo. In: FOCLASA 2008 (2008) (to appear)

    Google Scholar 

  11. Clarke, D., Costa, D., Arbab, F.: Connector colouring I: Synchronisation and context dependency. Sci. Comput. Program. 66(3), 205–225 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  12. Costa, D.: Formal Models for Context Dependent Connectors for Distributed Software Components and Services. Ph.D thesis (2009) (to appear)

    Google Scholar 

  13. de Boer, F., Kok, J., Palamidessi, C., Rutten, J.: Non-monotonic concurrent constraint programming. In: ILPS, pp. 315–334 (1993)

    Google Scholar 

  14. Fiadeiro, J., Lopes, A.: Community on the move: Architectures for distribution and mobility. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2003. LNCS, vol. 3188, pp. 177–196. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  15. Fournet, C., Gonthier, G.: The join calculus: A language for distributed mobile programming. In: Barthe, G., Dybjer, P., Pinto, L., Saraiva, J. (eds.) APPSEM 2000. LNCS, vol. 2395, pp. 268–332. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  16. Gelernter, D.: Generative communication in Linda. ACM Trans. Program. Lang. Syst. 7(1), 80–112 (1985)

    Article  MATH  Google Scholar 

  17. Scholten, J.: Mobile channels for exogenous coordination of distributed systems: semantics, implementation and composition. Ph.D thesis, LIACS, Faculty of Mathematics and Natural Sciences, Leiden University (January 2007)

    Google Scholar 

  18. Izadi, M., Bonsangue, M.: Recasting constraint automata into Büchi automata. In: Fitzgerald, J.S., Haxthausen, A.E., Yenigun, H. (eds.) ICTAC 2008. LNCS, vol. 5160, pp. 156–170. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  19. Izadi, M., Bonsangue, M., Clarke, D.: Modelling component connectors: Synchronisation and context-dependency. In: Proceedings of SEFM 2008. IEEE Computer Society Press, Los Alamitos (2008) (to appear)

    Google Scholar 

  20. Khosravi, R., Sirjani, M., Asoudeh, N., Sahebi, S., Iravanchi, H.: Modeling and analysis of Reo connectors using Alloy. In: Lea, D., Zavattaro, G. (eds.) COORDINATION 2008. LNCS, vol. 5052, pp. 169–183. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  21. Koehler, C., Arbab, F., de Vink, E.: Reconfiguring distributed Reo connectors. In: WADT (2009) (to appear)

    Google Scholar 

  22. Kozen, D.: On the coalgebraic theory of Kleene algebra with tests. TR 10173, Computing and Information Science, Cornell University (March 2008)

    Google Scholar 

  23. Lee, B., Lee, E.: Hierarchical concurrent finite state machines in Ptolemy. In: ACSD, pp. 34–40. IEEE Computer Society, Los Alamitos (1998)

    Google Scholar 

  24. Liu, X., Xiong, Y., Lee, E.: The Ptolemy ii framework for visual languages. In: HCC, p. 50. IEEE Computer Society, Los Alamitos (2001)

    Google Scholar 

  25. Maraikar, Z., Lazovik, A., Arbab, F.: Building mashups for the enterprise with SABRE. In: Bouguettaya, A., Krüger, I., Margaria, T. (eds.) ICSOC 2008. LNCS, vol. 5364, pp. 70–83. Springer, Heidelberg (2008)

    Google Scholar 

  26. Misra, J., Cook, W.: Computation orchestration: A basis for wide-area computing. Journal of Software and Systems Modeling (May 2006)

    Google Scholar 

  27. Mousavi, M., Sirjani, M., Arbab, F.: Formal semantics and analysis of component connectors in Reo. Electr. Notes Theor. Comput. Sci. 154(1), 83–99 (2006)

    Article  Google Scholar 

  28. Nierstrasz, O.: Piccola - a small compositional language (invited talk). In: Ciancarini, P., Fantechi, A., Gorrieri, R. (eds.) FMOODS. IFIP Conference Proceedings, vol. 139. Kluwer, Dordrecht (1999)

    Google Scholar 

  29. Rutten, J.: Coalgebra, concurrency, and control. In: Boel, R., Stremersch, G. (eds.) Discrete Event Systems (analysis and control), Proceedings of WODES 2000, pp. 31–38. Kluwer, Dordrecht (2000)

    Google Scholar 

  30. Shaw, M., Garlan, D.: Software Architecture. Prentice Hall, Englewood Cliffs (1996)

    MATH  Google Scholar 

  31. Szyperski, C.: Component Software: Beyond Object-Oriented Programming, 2nd edn. Addison-Wesley Professional, Reading (2002)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIACS, Leiden University, The Netherlands

    Marcello Bonsangue

  2. Dept. Computer Science, Katholieke Universiteit Leuven, Belgium

    Dave Clarke

  3. CWI, The Netherlands

    Marcello Bonsangue & Alexandra Silva

Authors
  1. Marcello Bonsangue
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dave Clarke
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alexandra Silva
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IBM T. J. Watson Research Center, 704, Yorktown Heights, H1-B24, P.O. Box, NY 10598, USA

    John Field

  2. Faculty of Sciences, Department of Informatics, University of Lisbon, Campo Grande, 1749-016, Lisboa, Portugal

    Vasco T. Vasconcelos

Rights and permissions

Reprints and permissions

Copyright information

© 2009 IFIP International Federation for Information Processing

About this paper

Cite this paper

Bonsangue, M., Clarke, D., Silva, A. (2009). Automata for Context-Dependent Connectors. In: Field, J., Vasconcelos, V.T. (eds) Coordination Models and Languages. COORDINATION 2009. Lecture Notes in Computer Science, vol 5521. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02053-7_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02053-7_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02052-0

  • Online ISBN: 978-3-642-02053-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation