×

zbMATH — the first resource for mathematics

Comparing three coordination models: Reo, ARC, and PBRD. (English) Zbl 1211.68056
Summary: Three models of coordination-Reo, Actors-Roles-Coordinators (ARC), and Policy-based Russian Dolls (PBRD)-are compared and contrasted according to a set of coordination features. Mappings between their semantic models are defined. Use of the models is illustrated by a small case study.

MSC:
68N15 Theory of programming languages
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Arbab, F.: Reo: A channel-based coordination model for component composition, Mathematical structures in computer science 14, 329-366 (2004) · Zbl 1085.68552 · doi:10.1017/S0960129504004153
[2] Ren, S.; Yu, Y.; Chen, N.; Marth, K.; Poirot, P. -E.; Shen, L.: Actors, roles and coordinators: A coordination model for open distributed and embedded systems, Lncs 4038, 247-265 (2006)
[3] Meseguer, J.; Talcott, C. L.: Semantic models for distributed object reflection, Lncs 2374, 1-36 (2002) · Zbl 1049.68815 · link.springer.de
[4] Koehler, C.; Lazovik, A.; Arbab, F.: Reoservice: coordination modeling tool, Lecture notes in computer science 4749, 625-626 (2007)
[5] A. Lazovik, F. Arbab, Using Reo for service coordination, in: ICSOC, 2007, pp. 398–403
[6] Meng, S.; Arbab, F.: Web services choreography and orchestration in reo and constraint automata, , 346-353 (2007)
[7] Tasharofi, S.; Vakilian, M.; Ziloochian, R.; Sirjani, M.: Modeling web services using coordination language reo, Lecture notes in computer science 4937, 108-123 (2007)
[8] Tasharofi, S.; Sirjani, M.: Formal modeling and conformance validation for WS-CDL using reo and CASM, Electronic notes in theoretical computer science 159, 99-115 (2008) · Zbl 1347.68240
[9] N. Kokash, F. Arbab, Applying Reo to service coordination in long-running business transactions, in: SAC, 2009, pp. 1381–1382
[10] F. Arbab, N. Kokash, S. Meng, Towards using Reo for compliance-aware business process modeling, in: ISoLA, 2008, pp. 108–123
[11] F. Arbab, L. Astefanoaei, F.S. de Boer, M. Dastani, J.-J.C. Meyer, N.A.M. Tinnemeier, Reo connectors as coordination artifacts in 2APL systems, in: PRIMA, 2008, pp. 42–53
[12] D. Clarke, D. Costa, F. Arbab, Modelling coordination in biological systems, in: ISoLA, 2004, pp. 9–25
[13] P.-H. Chang, G. Agha, Towards context-aware Web applications, in: 7th IFIP International Conference on Distributed Applications and Interoperable Systems (DAIS), 2007, pp. 239–252
[14] P.-H. Chang, G. Agha, Supporting reconfigurable object distribution for customized Web applications, in: The 22nd Annual ACM Symposium on Applied Computing, SAC, 2007, pp. 1286–1292
[15] Hewitt, C.: What is commitment? physical, organizational, and social (revised), Lecture notes in computer science, 293-307 (2007)
[16] E. Cheong, E.A. Lee, Y. Zhao, Viptos: A graphical development and simulation environment for tinyos-based wireless sensor networks, in: Proceedings of the 3rd international conference on Embedded networked sensor systems, SenSys 2005, 2005, pp. 302–302
[17] Papadopoulos, G. A.; Arbab, F.: Coordination models and languages, Advances in computers 46, 330-401 (1998)
[18] Arbab, F.: Composition of interacting computations, Interactive computation, 277-321 (2006) · Zbl 1266.68089
[19] Arbab, F.; Rutten, J.: A coinductive calculus of component connectors, Lncs 2755, 34-55 (2002) · Zbl 1278.68200
[20] Arbab, F.; Baier, C.; Rutten, J. J.; Sirjani, M.: Modeling component connectors in reo by constraint automata (extended abstract), Entcs 97, 25-46 (2003) · Zbl 1105.68058
[21] Baier, C.; Sirjani, M.; Arbab, F.; Rutten, J.: Modeling component connectors in reo by constraint automata, Science of computer programming 61, 75-113 (2006) · Zbl 1105.68058 · doi:10.1016/j.scico.2005.10.008
[22] Talcott, C. L.: Composable semantic models for actor theories, Higher-order and symbolic computation 11, No. 3, 281-343 (1998) · Zbl 0934.68058 · doi:10.1023/A:1010042915896
[23] Denker, G.; Meseguer, J.; Talcott, C. L.: Rewriting semantics of distributed meta objects and composable communication services, Entcs 36, 405-425 (2000) · Zbl 0962.68081 · www.elsevier.com
[24] Arbab, F.: Abstract behavior types: A foundation model for components and their composition, Science of computer programming, 3-52 (2005) · Zbl 1075.68014 · doi:10.1016/j.scico.2004.05.010
[25] Colman, A. W.; Han, J.: Coordination systems in role-based adaptive software, Lncs 3454, 63-78 (2005)
[26] Arbab, F.: The IWIM model for coordination of concurrent activities, Lncs 1061, 34-56 (1996)
[27] Cruz, J. C.; Ducasse, S.: A group based approach for coordinating active objects, Lncs 1594, 355-370 (1999)
[28] A. Omicini, F. Zambonelli, Tuple centres for the coordination of internet agents, in: Proceedings of the ACM Symposium on Applied Computing, 1999, pp. 183–190
[29] Omicini, A.; Denti, E.: Formal respect, Entcs 48, 179-196 (2001) · Zbl 1263.68033
[30] Omicini, A.: Formal respect in the A&A perspective, Entcs 175, 97-117 (2007)
[31] Berry, A.; Kaplan, S. M.: Open, distributed coordination with finesse, , 178-184 (1998)
[32] Cabri, G.; Ferrari, L.; Zambonelli, F.: Role-based approaches for engineering interactions in large-scale multi-agent systems, Lncs 2940, 243-263 (2003)
[33] Cremonini, M.; Omicini, A.; Zambonelli, F.: Coordination and access control in open distributed agent systems: the Tucson approach, Lncs 1906, 369-390 (2000)
[34] Zhang, W.; Serban, C.; Minsky, N. H.: Establishing global properties of multi-agent systems via local laws, Lncs 4389, 170-183 (2007)
[35] Varela, C. A.; Agha, G.: A hierarchical model for coordination of concurrent activities, Lncs 1594, 166-182 (1999)
[36] Venkatasubramanian, N.; Talcott, C. L.: Reasoning about meta level activities in open distributed systems, , 144-152 (1995) · Zbl 1374.68078
[37] Frølund, S.: Coordinating distributed objects: an actor based approach to synchronization, (1996)
[38] Meseguer, J.: Conditional rewriting logic as a unified model of concurrency, Theoretical computer science 96, No. 1, 73-155 (1992) · Zbl 0758.68043 · doi:10.1016/0304-3975(92)90182-F
[39] Agha, G.; Frølund, S.; Kim, W.; Panwar, R.; Patterson, A.; Sturman, D.: Abstraction and modularity mechanisms for concurrent computing, Parallel and distributed technology: systems and applications 1, No. 2, 3-14 (1993)
[40] G. Agha, S. Frølund, R. Panwar, D. Sturman, A linguistic framework for dynamic composition of dependability protocols, in: Proceedings of the IFIP Conference on Dependable Computing for Critical Applications, 1992
[41] Venkatasubramanian, N.; Talcott, C. L.: Reasoning about meta level activities in open distributed systems, , 144-152 (1995) · Zbl 1374.68078
[42] Venkatasubramanian, N.; Talcott, C.; Agha, G. A.: A formal model for reasoning about adaptive QoS-enabled middleware, ACM transactions on software engineering and methodology 13, No. 1, 86-147 (2004) · Zbl 0987.68888
[43] Talcott, C.: Coordination models based on a formal model of distributed object reflection, , 143-157 (2006)
[44] Talcott, C.: Policy-based coordination in pagoda: A case study, , 97-112 (2007)
[45] Gorrieri, R.; Hankin, C.: Theoretical aspects of coordination languages (foreword), Theoretical computer science 192, 163-165 (1998) · Zbl 0895.00029
[46] F. Arbab, What do you mean, coordination? in: Bulletin of the Dutch Association for Theoretical Computer Science, NVTI, 1998, pp. 11–22
[47] Agha, G.: Actors: A model of concurrent computation in distributed systems, (1986)
[48] Agha, G.; Mason, I. A.; Smith, S. F.; Talcott, C. L.: A foundation for actor computation, Journal of functional programming 7, 1-72 (1997) · Zbl 0870.68091
[49] Dill, D. L.: Timing assumptions and verification of finite-state concurrent systems, , 197-212 (1990)
[50] W. Clinger, Foundations of Actor Semantics, AI-TR- 633, MIT Artificial Intelligence Laboratory, May 1981
[51] Mason, I. A.; Talcott, C. L.: Actor languages their syntax, semantics, translation, and equivalence, Theoretical computer science 220, 409-467 (1999) · Zbl 0954.68089 · doi:10.1016/S0304-3975(99)00009-2
[52] Saraswat, V. A.: Concurrent constraint programming, (1993) · Zbl 1002.68026
[53] V. Saraswat, R. Jagadeesan, V. Gupta, Foundations of timed concurrent constraint programming, in: Proceedings of the Symposium on Logic in Computer Science, LICS’94, 1994, pp. 71–80 · Zbl 0942.68539
[54] Ren, S.; Yu, Y.; Chen, N.; Marth, K.; Poirot, P. -E.; Shen, L.: Actors, roles and coordinators – A coordination model for open distributed and embedded systems, Lncs 4038, 247-265 (2006)
[55] B. Carlson, Compiling and executing finite domain constraints, Ph.D. Thesis, Uppsala University, Sweden, 1995
[56] Carlson, B.; Carlsson, M.; Diaz, D.: Entailment of finite domain constraints, , 339-353 (1994)
[57] Hentenryck, P. V.; Saraswat, V. A.; Deville, Y.: Design, implementation, and evaluation of the constraint language \(cc(fd)\), Journal of logic programming 37, No. 1–3, 293-316 (1998) · Zbl 0920.68026 · doi:10.1016/S0743-1066(98)10006-7
[58] Bistarelli, S.; Montanari, U.; Rossi, F.: Soft concurrent constraint programming, ACM transactions on computer 7, No. 3, 563-589 (2006) · Zbl 1077.68570
[59] Clavel, M.; Durán, F.; Eker, S.; Lincoln, P.; Martí-Oliet, N.; Meseguer, J.; Talcott, C.: All about maude: A high-performance logical framework, Lncs 4350 (2007) · Zbl 1115.68046
[60] http://maude.cs.uiuc.edu, The Maude Homepage
[61] Meseguer, J.: Conditional rewriting logic as a unified model of concurrency, Theoretical computer science 96, No. 1, 73-155 (1992) · Zbl 0758.68043 · doi:10.1016/0304-3975(92)90182-F
[62] Arbab, F.; Baier, C.; De Boer, F.; Rutten, J.: Models and temporal logics for timed component connectors, , 198-207 (2004)
[63] Mousavi, M. R.; Sirjani, M.; Arbab, F.: Formal semantics and analysis of component connectors in reo, Entcs 154, 83-99 (2006)
[64] Clarke, D.; Costa, D.; Arbab, F.: Connector colouring I: Synchronisation and context dependency, Entcs 154, 101-119 (2006) · Zbl 1121.68015
[65] Chen, N.; Ren, S.: Building a coordination framework to support behavior-based adaptive checkpointing for open distributed embedded systems, (2007)
[66] Clarke, D.: Reasoning about connector reconfiguration II: Basic reconfiguration logic, Entcs 159, 61-77 (2006)
[67] Clarke, D.: A basic logic for reasoning about connector reconfiguration, Fundamenta informaticae 82, 361-390 (2008) · Zbl 1147.68570
[68] Klüppelholz, S.; Baier, C.: Symbolic model checking for channel-based component connectors, Entcs 175, 19-37 (2007) · Zbl 1167.68035
[69] Jr., E. M. Clarke; Grumberg, O.; Peled, D. A.: Model checking, (1999)
[70] M. Bickford, R.L. Constable, A causal logic of events in formalized computational type theory, Tech. Rep. Technical Report 2005–2010, Cornell University, 2005. http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cis/TR2005-2010
[71] Meseguer, J.: The temporal logic of rewriting: A gentle introduction, Lncs 5065 (2008) · Zbl 1143.68459
[72] K. Bae, J. Meseguer, A rewriting-based model checker for the linear temporal logic of rewriting, in: 9th International Workshop on Rule-based Programming, RULE 2008, 2008 · Zbl 1291.68244
[73] Pourvatan, B.; Rouhy, N.: An alternative algorithm for constraint automata product, Lncs 4767, 412-422 (2007) · Zbl 1141.68439 · doi:10.1007/978-3-540-75698-9_29
[74] Arbab, F.: A behavioral model for composition of software components, L’objet 12, No. 1, 33-76 (2006)
[75] Gelernter, D.: Generative communication in linda, ACM transactions on programming languages and sysystems (TOPLAS) 7, No. 1, 80-112 (1985) · Zbl 0559.68030 · doi:10.1145/2363.2433 · www.acm.org
[76] G. Picco, A. Murphy, G.-C. Roman, LIME: Linda meets mobility, in: 21 Int. Conf. on Software Engineering, 1999, pp. 368–377
[77] De Nicola, R.; Ferrari, G.; Pugliese, R.: KLAIM: A kernel language for agents interaction and mobility, IEEE transactions on software engineering 24, No. 5, 315-330 (1998)
[78] De Nicola, R.; Katoen, J.; Latella, D.; Massink, M.: Towards a logic for performance and mobility, Entcs 153, 161-175 (2006)
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.