zbMATH — the first resource for mathematics

Connector rewriting with high-level replacement systems. (English) Zbl 1277.68193
Canal, Carlos (ed.) et al., Proceedings of the 6th international workshop on the foundations of coordination languages and software architectures (FOCLASA 2007), Lisbon, Portugal, September 8, 2007. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 194, No. 4, 77-92 (2008).
Summary: Reo is a language for coordinating autonomous components in distributed environments. Coordination in Reo is performed by circuit-like connectors, which are constructed from primitive channels with well-defined behavior. These channels are mobile, i.e., can be dynamically created and reconfigured at run-time. Based on these language features, we introduce a high-level transformation system for Reo. We show how transformations of Reo connectors can be defined using the theory of high-level replacement (HLR) systems. This leads to a powerful notion of dynamic connector reconfiguration in Reo. Moreover, the rewrite rules are naturally expressed in Reo’s visual syntax for connectors.
Applications of this framework are manifold, due to the generality of the field of coordination. In this paper we provide an example from the area of service-oriented computing.
For the entire collection see [Zbl 1276.68010].

68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68Q42 Grammars and rewriting systems
Reo; Reoservice
Full Text: DOI
[1] Arbab, F., Reo: a channel-based coordination model for component composition, Mathematical structures in computer science, 14, 329-366, (2004) · Zbl 1085.68552
[2] F. Arbab, C. Baier, J. Rutten, and M. Sirjani. Modeling component connectors in Reo by constraint automata. Technical report, CWI Technical Report SEN-R0304, ISSN 1386-369X, 2003 · Zbl 1105.68058
[3] Arbab, F.; Chothia, T.; Meng, S.; Moon, Y.-J., Component connectors with QoS guarantees, (), 286-304
[4] Bachmann, F.; Bass, L., Managing variability in software architecture, (2001), ACM Press
[5] Basten, T.; van der Aalst, W.M.P., Inheritance of behavior, J. log. algebr. program., 47, 2, 47-145, (2001) · Zbl 0974.68137
[6] E. Biermann, K. Ehrig, C. Koehler, G. Kuhns, G. Taentzer, and E. Weiss. Graphical defnition of in-place transformations in the eclipse modeling framework. In Model Driven Engineering Languages and Systems (MoDELS’06), 2006
[7] F. Casati, M. Sayal, and M. Shan. Developing e-services for composing e-services. In 13th Int. Conf. on Advanced Information Systems Engineering (CAiSE), 2001 · Zbl 0980.68649
[8] Chen, L.; Shadbolt, N.R.; Goble, C.; Tao, F.; Cox, S.J.; Puleston, C.; Smart, P., Towards a knowledge-based approach to semantic service composition, ()
[9] D. Clarke. Reasoning about connector reconfiguration I: Equivalence of constructions. Technical report, CWI Technical Report SEN-R0506, 2004
[10] D. Clarke. Reasoning about connector reconfiguration II: Basic reconfiguration logic. Proc. of FSEN 2005. Tehran, Iran, 2005 · Zbl 1147.68570
[11] D. Clarke, D. Costa, and F. Arbab. Connector colouring I: Synchronisation and context dependency. Proc. of Foclasa 2005, San Francisco, 2005 · Zbl 1121.68015
[12] Corradini, A.; Ehrig, H.; Heckel, R.; Korff, M.; Löwe, M.; Ribeiro, L.; Wagner, A., Algebraic approaches to graph transformation – part I: single pushout approach and comparison with double pushout approach, (), 247-312
[13] T. Curran and G. Keller. SAP R/3 Business Blueprint: Understanding the Business Process Reference Model. Upper Saddle River, 1997
[14] Eclipse coordination tools
[15] Ehrig, H.; Ehrig, K.; Prange, U.; Taentzer, G., Fundamentals of algebraic graph transformation, EATCS monographs in theoretical computer science, (2006), Springer · Zbl 1095.68047
[16] Ehrig, H.; Habel, A.; Kreowski, H.-J.; Parisi-Presicce, F., Parallelism and concurrency in high-level replacement systems, Mathematical structures in computer science, 1, 3, 361-404, (1991) · Zbl 0749.68045
[17] H. Ehrig and B. König. Deriving bisimulation congruences in the DPO approach to graph rewriting. In FoSSaCS, pages 151-166, 2004 · Zbl 1126.68446
[18] Haller, P.; Odersky, M., Actors that unify threads and events, ()
[19] Halmans, G.; Pohl, K., Communicating the variability of a software-product family to customers, Software and system modeling, 2, 1, 15-36, (2003)
[20] R. Heckel and A. Cherchago. Structural and behavioral compatibility of graphical service specifications. Journal of Logic and Algebraic Programming, 2006. To appear · Zbl 1178.68033
[21] S. Klueppelholz and C. Baier. Symbolic model checking for channel-based component connectors. In FOCLASA’06, 2006
[22] C. Koehler, A. Lazovik, and F. Arbab. ReoService: coordination modeling tool. In ICSOC-07, 2007
[23] Lack, S.; Sobociński, P., Adhesive categories, (), 273-288 · Zbl 1126.68447
[24] Lazovik, A.; Aiello, M.; Papazoglou, M., Planning and monitoring the execution of web service requests, Journal on digital libraries, (2005)
[25] J. Mendling, J. Recker, M. Rosemann, and W.M.P. van der Aalst. Towards the interchange of configurable EPCs. In EMISA, pages 8-21, 2005
[26] S. Meng. Qccs: A formal model to enforce QoS requirements in service composition. In Accepted by 1st IEEE and IFIP International Symposium on Theoretical Aspects of Software Engineering, TASE’07, 2007
[27] OTA, Open travel alliance
[28] J. Padberg. Survey of high-level replacement systems. Technical report, Technical University of Berlin, 1993 · Zbl 0785.68064
[29] M. Paolucci, T. Kawamura, T. Payne, and K. Sycara. Semantic matching of web services capabilities. In Int. Semantic Web Conf. (ISWC), pages 333-347, 2002 · Zbl 1048.68873
[30] D. Plump. Hypergraph rewriting: Critical pairs and undecidability of confluence. In M.J. Plasmeijer M.R. Sleep and M.C.J.D. van Eekelen, editors, Term Graph Rewriting: Theory and Practice, pages 201-213, 1993
[31] Rosemann, M.; van der Aalst, W.M.P., A configurable reference modelling language, Inf. syst., 32, 1, 1-23, (2007)
[32] SAP, Online documentation mysap ERP, (2005)
[33] Sirin, E.; Parsia, B.; Hendler, J., Filtering and selecting semantic web services with interactive composition techniques, IEEE intelligent systems, 19, 4, (2004)
[34] S. Thakkar, J. Ambite, C. Knoblock, and C. Shahabi. Dynamically composing web services from on-line sources. In AAAI Workshop Intelligent Service Integr., 2002
[35] D. Wu, B. Parsia, E. Sirin, J. Hendler, and D. Nau. Automating DAML-S web services composition using SHOP2. In ISWC-03, 2003
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.