Coordination Languages and Models: Third International Conference, COORDINATION'99, Amsterdam, The Netherlands, April 26-28, 1999, Proceedings (Lecture Notes in Computer Science, 1594)

✍ Scribed by Paolo Ciancarini (editor), Alexander L. Wolf (editor)

• Publisher: Springer
• Year: 1999
• Tongue: English
• Leaves: 430
• Category: Library

✦ Synopsis

We welcome you to Coordination ’99, the third in a series of conferences d- icated to an important perspective on the development of complex software systems. That perspective is shared by a growing community of researchers - terested in models, languages, and implementation techniques for coordination. The last decade has seen the emergence of a class of models and languages variously termed “coordination languages”, “con?guration languages”, “arc- tectural description languages”, and “agent-oriented programming languages”. Theseformalismsprovideacleanseparationbetweenindividualsoftwarecom- nents and their interaction within the overall software organization. This se- ration makes complex applications more tractable, supports global analysis,and enhances the reuse of software components. The proceedings of the previous two conferences on this topic were published by Springer as Lecture Notes in Computer Science 1061 and 1282. This issue of LNCS containing the papers presented at Coordination ’99 continues the tradition of carefully selected and high quality papers representing the state of the artin coordinationtechnology.In responseto thecallfor papers,wereceived 67 submissions, from which 26 papers were accepted. These proceedings also contain abstracts for posters presented at the conference. This year’s program features invited talks by Rocco De Nicola and Danny B. Lange. Reading through the papers, we expect that you may be surprised by the variety of disciplines within computer science that have embraced the notion of coordination. In fact, we expect this trend to continue, and hope that you will contribute to the on-going exploration of its strengths, weaknesses, and applications.

✦ Table of Contents

Coordinatio Language and Models
Foreword
Organization
Table of Contents
Coordination and Access Control of Mobile Agents
Characteristics of an Agent Scripting Language and its Execution Environment
A Coordination Model for Agents based on Secure Spaces
1 Introduction
2 Shared Spaces
3 Secure Object Spaces
3.1 The SECOS programming language
3.2 Matching, Keys and Dynamic Typing
3.3 Reduction semantics
3.4 Examples of SECOS Programming
4 SECOS on Java
4.1 Classes
4.2 Coordinating Agents
5 A Cryptographic Implementaion of SECOS
5.1 Cryptography
5.2 Implementing Locking in Open Enviroments
6 Related Work
7 Conclusion
References
Coordination with Attributes
1 Introduction
1.1 Object Attributes
1.2 Linda
1.3 Motivation
2 The Design Space
2.1 Access-control Attributes in Linda
2.2 Semantic Implications
3 Attribute-Supported Coordination Structures
3.1 Access-control Attributes
3.2 Other Attributes
4 Implementation Considerations
4.1 Conventional Approaches
5 Related Work
6 Conclusion
References
MobiS: A Specification Language for Mobile Systems
1 Introduction
2 Overview of MobiS
3 Specification of Architectural Styles for Mobility
4 Application of the Styles to the Architecture of a Mobile System
5 Related work and Conclusions
References
Coordinated Roles: Promoting Re-usability of Coordinated Active Objects Using Event Notification Protocols1
1 Introduction
2 Background and Motivation
3 Event Notification Protocols
4 Coordinated Roles
4.1 The model: Roles and Coordinated Roles
4.2 Coordinators and hierarchies of coordinators
4.3 Compound events
4.4 Some simple examples
4.4.1 The car park
4.4.2 Introducing coordinators extensibility
4.4.3 Introducing shared objects among several coordinators
4.4.4 Introducing composability, polymorphism, and distribution of coordination patterns
4.4.5 Introducing the flexibility of the model
4.5 Coordinated Roles in ATOM
5 Related works
6 Conclusions and Future Work
References
Pipelining the Molecule Soup: A Plumber's Approach to Gamma
1 Introduction
1.1 The Gamma Model
1.2 Refinement Relations
1.3 Producer-Consumer Systems
2 Simulations: Tools for Formal Refinement
2.1 Statebased and Stateless Simulations
2.3 Congruence, Compositionality
2.4 Convex Simulation
2.5 Data-equivalent Simulation
3 The Pipelining Transformations
3.1 Statebased Refinement
3.2 IO Equivalence
3.3 Convex Refinement
4 Applying the Pipelining Transformations
4.1 Tagging and Trimming
4.2 Pipelining: the CGZ Example.
5 Conclusions
References
Erratic Fudgets: A Semantic Theory for an Embedded Coordination Language
1 Introduction
1.1 Contributions
1.2 Organisation
2 Related Work
2.1 Fudget Calculi
2.2 Other functional GUIs
2.3 Non-Determinism in Functional Languages
3 The Essence of Fudgets
3.1 The stream processor calculus
3.2 Implementing the Stream Processors
4 The Operational Theory
4.1 The Abstract Machine
4.2 Program Contexts
4.3 Refinement and Observational Equivalence
4.4 Unique Fixed-Point Induction
5 Correctness of the Translation
5.1 Properties of Merge
5.2 The Congruences
5.3 The Reduction Rules
6 Conclusions and Future Work
References
Coordination of Synchronous Programs
1 Introduction
1.1 Our proposal
1.2 Related Works
2 Underlying Architecture
3 Esterel with Coordination Primitives
3.1 Modules and interface
3.2 Statements
3.3 The Coordination Primitives
3.4 Blackboards
3.5 Asynchronous Parallel Composition
4 Behavioural Semantics
4.1 Blackboards
4.2 Coordination Primitives
4.3 Asynchronous Parallel Composition
5 Properties and Perspectives
5.1 Perspectives
References
Composing Specifications for Coordination
1 Introduction
2 Oikos_adtl
2.1 The Computational Model
2.2 Oikos_adtl Semantics
2.3 Composing Specifications
2.4 Composition Theorems
3 Coordination Templates
3.1 Broadcast
3.2 Moderated Publish-subscribe
4 Case Study
5 Related Work
6 Conclusions
References
On the Expressiveness of Coordination Models
1 Introduction
1.1 Motivations
1.2 Comparing the expressive power of coordination languages
1.3 Results of the comparisons
1.4 Related work
1.5 Plan of the paper
2 The family of coordination languages
2.1 Common syntax and rules
2.2 LL: Linda
2.3 LMR: Multi-set rewriting
2.4 LCS: Communication transactions
3 Operational semantics
3.1 Observables
3.2 Normal form
4 Modular embedding
5 Comparisons
5.1 Intuitive analysis of the results
5.2 Formal results
6 Concluding remarks
References
Comparing Software Architectures for Coordination Languages
1 Introduction
2 Processing and data elements
3 Three software architectures
3.1 The locally delayed architecture
3.2 The globally delayed architecture
3.3 The undelayed architecture
4 Modeling coordination languages
4.1 A shared data-driven language
4.2 A distributed data-driven language
4.3 A control-oriented language
5 Comparing the architectures
5.1 Comparison without consuming data
5.2 Consuming data, locally
5.3 Consuming data, globally
6 Conclusions and related work
References
A Alternative global delete operators
A Hierarchical Model for Coordination of Concurrent Activities
1 Motivation
2 Related Work
3 A Hierarchical Model for Coordination
3.1 Directors and casts
3.2 Messengers
4 Semantics based on Actor Configurations
4.1 A Simple Lambda Based Actor Language
4.2 Operational Semantics for Coordinated Configurations
5 Sample Applications
5.1 Atomic Multicast Protocols
5.2 Remote Exception Handling with a Messenger
6 Discussion
References
A Self-Deploying Election Service for Active Networks
1 Introduction
2 Active Network Segments and Self-Deploying Services
2.1 A Service Architecture for Active Networks
2.2 Self-deploying Services in Active Networks
3 Election Services
3.1 The Bully Election Algorithm
3.2 A Best-Effort Election Algorithm
3.3 Deployment Protocol
4 An Implementation
5 Discussion
5.1 Related Work
6 Conclusions
References
Mobile Co-ordination: Providing Fault Tolerance in Tuple Space Based Co-ordination Languages
1 Introduction
2 Transactions
3 Mobile Co-ordination
4 Using mobile co-ordination for Agent Wills
5 Implementation
6 Performance
7 Future work
8 Conclusion
References
A Simple Extension of Java Language for Controllable Transparent Migration and its Portable Implementation
1 Introduction
2 Java Language Extension
2.1 Starting Migration by Using Go Primitive
2.2 Controlling Transparency by Using Undock Primitive
2.3 Declaring Method by Using Migratory Primitive
3 Overview of Our Transparent Migration
3.1 Saving the Execution State
3.2 Transmitting the Execution State
3.3 Restoring the Execution State
4 Resuming a Method
4.1 Preprocessings
4.2 Jump Facility
4.3 Unfolding Technique
5 Saving and Restoring Local Variable Values
5.1 The Arachne Scheme
5.2 Our Scheme
6 Reconstructing Stack of Method Invocations
7 Limitations due to Source-Level Translation
8 Performance
9 Sample Mobile Applications
10 Conclusion
References
Coordination Among Mobile Objects
1 Introduction
2 Distributed OO-action systems
3 Specifying movement
4 Coordinators
5 Concluding remarks
References
Simulation of Conference Management using an Event-Driven Coordination Language
1 Introduction
2 A case study in coordination: Conference Management on the Internet
2.1 Specification of the problem
3 An overview of MANIFOLD
3.1 The language MANIFOLD
4 Description of the application
4.1 Design of the application
5 Discussion
5.1 Some remarks on the problem object of study
5.2 A comparison between various approaches
5.3 Control driven coordination versus Shared dataspace coordination
6 Concluding remarks
References
Internet-Based Coordination Environments and Document-Based Applications: a Case Study
1 Introduction
2 The case study
2.1 Agents and Roles
2.2 Dynamics of the case study
2.3 "Solving" the case study
3 Designing an active Web
4 The WWW as an agent world
4.1 The PageSpace
4.2 Coordination mechanisms for agents
5 Designing a conference management system
5.1 A conference management system
6 Conclusions and Future Work
References
Coordination of a Parallel Proposition Solver
1 Introduction
2 A Formal Description of the Proposition Solver
3 The Coordination in the Proposition Solver
4 Restructuring the UQE Transformation
5 Some Experiments
5.1 The Test Assertion
5.2 The General Format of the Test Assertions
5.3 Verification and Performance Results
6 Conclusions
References
CLAM: Composition Language for Autonomous Megamodules
1 Introduction
2 CLAM in a Sea of Languages
2.1 Objectives
2.2 Other Approaches
2.3 MANIFOLD
2.4 A CLAM Language Program
3 CLAM Language Semantics
3.1 Parallelism
3.2 Novel Optimization Opportunities
3.3 Simplicity in Control Flow
4 Implementing CLAM
4.1 CLAM Repository
4.2 CLAM Data Types
5 Conclusions
References
Modeling Resources for Activity Coordination and Scheduling
1 Introduction
2 Overview
3 Experiences with our approach
3.1 Integration with Little-JIL
3.2 Integration with a Multi-Agent Planning System
4 Related work and other Approaches
4.1 Related work in software process
4.2 Related work in operating systems
4.3 Related work in AI planning systems
4.4 Related work in management
4.5 Related work in other distributed software systems
5 Evaluation and Future Work
6 Acknowledgments
References
Static Analysis of Real-Time Component-based Systems Configurations
1 Introduction
2 The Language and Its Transitional Semantics
3 The Mine Pump
4 The Lip Synchronization Problem
5 Analyzing System Behaviors
6 Related Works
7 Conclusions and Future Work
References
Acme-based Software Architecture Interchange
1 Introduction
2 Wright, Rapide, and Aesop
2.1 Aesop
3 Integration Scheme
4 Integration Details
5 Example
6 Recent Development
6.1 MetaH Acme Integration
6.2 Unicon Acme Integration
7 Discussion and Conclusion
8 Acknowledgements
References
A Group Based Approach for Coordinating Active Objects
1 Introduction
2 Language Support for Coordination in COO Systems
2.1 Requirements for a Coordination Language for Active Objects
3 The CoLaS Coordination Model
3.1 Participants
3.2 Coordination Groups
4 A Detailed View of the CoLaS Model
4.1 A Case Study - The Gas Station System
4.2 Role Specification
4.3 Coordination State
4.4 Coordination Behaviour Specification.
4.4.1 Cooperation Protocol Specification
4.4.2 Multi-Action Synchronizations
4.4.3 Proactive Behaviour
4.5 Participants: Creation and Enrollment in Groups
5 Dynamic Aspects
6 Illustrating Proactive Behaviour - The Electronic Vote
7 Evaluation of the CoLaS Model
8 Related Work and Conclusions
References
Introducing Connections Into Classes With Static Meta-Programming
1 Introduction
2 The open language OpenJava
3 Applying a Compost connector
3.1 The example: Towers of Hanoi
3.2 How the observification works
3.3 Other composition operators: the packifier
3.4 A simple driver
4 Integrating software architecture with conventional process and variant management
5 The Compost library of meta-operators
6 Conclusion
References
TRUCE: Agent Coordination Through Concurrent Interpretation of Role-Based Protocols
1 Introduction
2 Coordination Languages
3 Collaboration Group
4 Coordination Protocols
5 Concurrent Role-Based Interpretation
5.1 Roles
5.2 Role-Based Programming
5.3 Role Binding
5.4 Concurrent Interpretation
6 Implementation
7 Example
7.1 Description
7.2 Solution
8 Conclusion
References
The STL++
Coordination Language: A Base for Implementing Distributed Multi-agent Applications
1 Introduction
2 Coordination in Multi-Agent Systems
2.1 Communication and Coordination between Agents
3 STL++ A Coordination Language for Multi-Agent Systems
3.1 Coordination using Encapsulation: ECM
3.2 The Coordination Language STL++
4 Simulation of a Trading System
5 Discussion
5.1 STL++ a Coordination Language
5.2 Implementing Coordination in MAS with STL++
6 Conclusion
References
A Distributed Semantics for a IWIM-Based Coordination Language
1 The Modelling Language CO-OPN/2, and COIL
2 COIL is an IWIM-based Coordination Model
3 A Formal Distributed Semantics for COIL
Coordination in Context: Authentication, Auhtorisation and Topology in Mobile Agent Applications
Presence and Instant Messaging via HTTP/1.1: A Coordination Perspective
Towards a Periodic Table of Connectors
Author Index