Abstract
In recent years, a promising line of research on formal compositional models for component connectors [3-6, 8, 9] has demonstrated the merits of having connectors as first class concepts, and incrementally increased the expressiveness of the interaction protocols that can be captured compositionally. Typically, in these models connectors are entitled to have their own specification and abstractions. Through composition, just like components, connectors can be combined and yield more sophisticated connectors.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arbab, F.: Reo: a channel-based coordination model for component composition. Mathematical Structures in Computer Science 14(3), 329–366 (2004)
Arbab, F., Chothia, T., van der Mei, R., Meng, S., Moon, Y.J., 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)
Arbab, F., Rutten, J.J.M.M.: 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)
Baier, C., Sirjani, M., Arbab, F., Rutten, J.: Modeling component connectors in Reo by Constraint Automata. SCP 61(2), 75–113 (2006)
Barbosa, M.A., Barbosa, L.S.: A perspective on service orchestration. SCP 74(9), 671–687 (2009)
Bonsangue, M., Clarke, D., Silva, A.: Automata for Context-Dependent Connectors. In: Field, J., Vasconcelos, V.T. (eds.) COORDINATION 2009. LNCS, vol. 5521, pp. 184–203. Springer, Heidelberg (2009)
Brock, J.D., Ackerman, W.B.: Scenarios: A model of non-determinate computation. In: Díaz, J., Ramos, I. (eds.) Formalization of Programming Concepts. LNCS, vol. 107, pp. 252–259. Springer, Heidelberg (1981)
Bruni, R., Lanese, I., Montanari, U.: A basic algebra of stateless connectors. TCS 366(1-2), 98–120 (2006)
Clarke, D., Costa, D., Arbab, F.: Connector Colouring I: Synchronisation and Context Dependency. SCP 66(3), 205–225 (2007)
Costa, D.: Formal Models For Component Connectors. Ph.D. thesis, VUA (2010), http://dare.ubvu.vu.nl/handle/1871/16380
Fiadeiro, J.: Categories for Software Engineering. Springer, Heidelberg (2004)
Gelernter, D., Carriero, N.: Coordination languages and their significance. Commun. ACM 35(2), 97–107 (1992)
Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Addison-Wesley LP Co., Inc. (2006)
Milner, R.: Communication and Concurrency. Prentice-Hall, Inc. (1989)
Park, D.: Concurrency and Automata on Infinite Sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol. 104, pp. 167–183. Springer, Heidelberg (1981)
Perry, D.E., Wolf, A.L.: Foundations for the study of software architecture. SIGSOFT Softw. Eng. Notes 17, 40–52 (1992)
Shaw, M.: Procedure Calls are the Assembly Language of Software Interconnection: Connectors Deserve First-Class Status. In: Lamb, D.A. (ed.) ICSE-WS 1993. LNCS, vol. 1078, pp. 17–32. Springer, Heidelberg (1996)
Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A Theory of Communicating Sequential Processes. J. ACM 31(3), 560–599 (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Costa, D., Niqui, M., Rutten, J. (2012). Intentional Automata: A Context-Dependent Model for Component Connectors. In: Arbab, F., Sirjani, M. (eds) Fundamentals of Software Engineering. FSEN 2011. Lecture Notes in Computer Science, vol 7141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29320-7_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-29320-7_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29319-1
Online ISBN: 978-3-642-29320-7
eBook Packages: Computer ScienceComputer Science (R0)