skip to main content
10.1145/508791.508849acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
Article

Editorial message: special track on coordination models, languages and applications

Published:11 March 2002Publication History

ABSTRACT

The notion of coordination is more and more pervading many research fields both inside and outside Computer Science. Many research areas such as software engineering, intelligent systems, agent technologies, Internet applications, programming languages, parallel and distributed computing, all raise issues that concern the interaction among different sorts of entities --- processes, objects, components, agents --- as well as its management. Despite their apparent diversity, this wide and heterogeneous range of problems actually exhibit large overlaps, and can be effectively faced and solved using a relatively reduced set of conceptual tools --- the notion of coordination model among the main ones. The purpose of a coordination model is represent and shape the space of interaction among entities --- whatever they are, however they interact. >From an engineering viewpoint, coordination languages and systems should enable engineers to integrate a number of possibly heterogeneous components, and to govern their interaction so as to form a (potentially distributed) software system with desired characteristics and functionalities.Accordingly, the Special Track on Coordination Models, Languages and Applications takes deliberately a broad view of what is coordination. Besides the traditional areas covering data-driven, control-driven, and hybrid models and languages, the track invited contributions from several areas where the concept of coordination is relevant, such as multiagent systems, Web applications, software architectures, middleware platforms, knowledge-based systems, groupware and workflow management, etc.In response to the call for papers, 42 high quality submissions from 18 different countries were submitted to this special track, and fed into the reviewing process. Altogether, there were more than 100 reviewers, and over 235 reviews were submitted by them --- an average of more than 5 reviews for each paper. Based on the reviewers' reports, the general ACM SAC guidelines for acceptance and rejection of submissions, and the unavoidable time and space constraints associated with any conference, it was possible to select only 16 of these submissions as regular papers for presentation at the track. In the process, a number of good and interesting papers had to be rejected. Among the papers presented at the special track, a further selection and revision process will lead to the publication of a Special Issue on Coordination and Knowledge Engineering that will appear on The Knowledge Engineering Review (http://uk.cambridge.org/journals/ker/).

References

  1. Sherief Abdallah, Nevin Darwish, Osman Hegazy, and Ihab Talkhan. Monitoring and synchronization for team-work in GPGP.Google ScholarGoogle Scholar
  2. Paul Davidsson and Fredrik Wernstedt. A coordination mechanism for just-in-time production and distribution.Google ScholarGoogle Scholar
  3. Elth Ogston and Stamatis Vassiliadis. Unstructured agent matchmaking: Experiments in timing and fuzzy matching.Google ScholarGoogle Scholar
  4. Anthony Karageorgos, Simon Thompson, and Nikolay Mehandjiev. Semi-automatic design of agent organisations.Google ScholarGoogle Scholar
  5. Neal Sample, Dorothea Beringer, and Gio Wiederhold. A comprehensive model for arbitrary result extraction. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Guangxin (Gavin) Yang. A uniform meta-model for modeling integrated cooperation.Google ScholarGoogle Scholar
  7. Jinlei Jiang, Guangxin (Gavin) Yang, Yan Wu, and Meilin Shi. CovaTM: A transaction model for cooperative applications. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Paolo Ciancarini, Robert Tolksdorf, and Franco Zambonelli. Coordination middleware for XML-centric applications. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Philipp Obreiter and Guntram Gräf. Towards scalability in tuple spaces. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Jozef Hooman and Jaco van de Pol. Formal verification of replication on a distributed data space architecture. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Nadia Busi and Gianluigi Zavattaro. On the serializability of transactions in shared dataspaces with temporary data. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Federico Bergenti and Alessandro Ricci. Three approaches to the coordination of multiagent systems. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Lorenzo Bettini, Michele Loreti, and Rosario Pugliese. An infrastructure language for open nets. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. José A. Pérez, Rafael Corchuelo, David Ruiz, and Miguel Toro. An enablement detection algorithm for open multiparty interactions.Google ScholarGoogle Scholar
  15. Ludger Fiege, Gero Mühl, and Felix C. Gärtner. A modular approach to building event-based systems. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Francisco Heron de Carvalho Jr., Rafael Dueire Lins, and Ricardo Massa Ferreira Lima. Coordinating functional processes with Haskell#.Google ScholarGoogle Scholar

Index Terms

  1. Editorial message: special track on coordination models, languages and applications

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in
            • Published in

              cover image ACM Conferences
              SAC '02: Proceedings of the 2002 ACM symposium on Applied computing
              March 2002
              1200 pages
              ISBN:1581134452
              DOI:10.1145/508791

              Copyright © 2002 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 11 March 2002

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • Article

              Acceptance Rates

              Overall Acceptance Rate1,650of6,669submissions,25%
            • Article Metrics

              • Downloads (Last 12 months)0
              • Downloads (Last 6 weeks)0

              Other Metrics

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader