Coordination Languages and Models: First International Conference, Coordination '96, Cesena, Italy, April 15-17, 1996: Proceedings (Lecture Notes in Computer Science)

This book constitutes the refereed proceedings of the First International Conference on Coordination Languages and Models, COORDINATION '96, held in Cesena, Italy in April 1996. Over the last few years, a new class of models, formalisms, and mechanisms for describing concurrent and distributed computations has emerged. A characteristic feature of these coordination languages and models is that they are based on (generative) communication via a shared data space. The 21 revised full papers presented were selected from a total of 78 submissions; also included are three invited papers and 10 posters. All in all, these papers report the state of the art in this young and active area of research and development. Parallel multiset processing: From explicit coordination to chemical reaction....Pages 1-11 Graph rewriting and constraint solving for modelling distributed systems with synchronization (extended abstract)....Pages 12-27 Coordination as constrained interaction (extended abstract)....Pages 28-33 The IWIM model for coordination of concurrent activities....Pages 34-56 Sonia: An adaptation of Linda for coordination of activities in organizations....Pages 57-74 The ToolBus coordination architecture....Pages 75-88 Enhancing coordination and modularity mechanisms for a language with objects-as-multisets....Pages 89-106 Towards a compositional method for coordinating Gamma programs....Pages 107-123 Introducing a calculus for higher-order multiset programming....Pages 124-141 μ 2 Log: Towards remote coordination....Pages 142-159 A process algebra based on Linda....Pages 160-178 Intra- and inter-object coordination with MESSENGERS....Pages 179-196 Ariadne and HOPLa: Flexible coordination of collaborative processes....Pages 197-214 Coordination in the ImpUnity framework....Pages 215-230 Compiler correctness for concurrent languages....Pages 231-248 A software environment for concurrent coordinated programming....Pages 249-266 Designing a coordination model for open systems....Pages 267-284 CCE: A process-calculus based formalism for specifying multi-object coordination....Pages 285-304 An extensible framework for the development of coordinated applications....Pages 305-320 Broadcasting in time....Pages 321-338 Semantics of a higher-order coordination language....Pages 339-356 Solving the Linda multiple rd problem....Pages 357-367 Coordinating distributed objects with declarative interfaces....Pages 368-385 Coordinating services in open distributed systems with Laura....Pages 386-402 Visifold: A visual environment for a coordination language....Pages 403-406 ALWAN: A skeleton programming language....Pages 407-410 Weaving the Web using coordination....Pages 411-415 Investigating strategies for cooperative planning of independent agents through prototype evaluation....Pages 416-419 A case study of integration of a software process management system with software engineering environments for process monitoring and management....Pages 420-423 Nepi: A network programming language based on the π-calculus....Pages 424-427 Modelling interoperability by CHAM: A case study....Pages 428-431 Integrating coordination features in PVM....Pages 432-435 A simulator framework for embedded systems....Pages 436-439 Understanding behavior of business process models....Pages 440-443 "This book constitutes the refereed proceedings of the First International Conference on Coordination Languages and Models, COORDINATION '96, held in Cesena, Italy in April 1996. Over the last few years, a new class of models, formalisms, and mechanisms for describing concurrent and distributed computations has emerged. A characteristic feature of these coordination languages and models is that they are based on (generative) communication via a shared data space. The 21 revised full papers presented were selected from a total of 78 submissions; also included are three invited papers and 10 posters. All in all, these papers report the state of the art in this young and active area of research and development."--PUBLISHER'S WEBSITE The maximum element can in fact be computed by performing the comparisons of the elements in any order : every "confrontation" between two elements cancels the smaller one, and the unique remaining element will be the maximum.