Coordination Models and Languages: 5th International Conference, COORDINATION 2002, YORK, UK, April 8-11, 2002, Proceedings

✍ Scribed by Farhad Arbab (editor), Carolyn Talcott (editor)

• Publisher: Springer
• Year: 2002
• Tongue: English
• Leaves: 417
• Series: Lecture Notes in Computer Science; 2315
• Category: Library

✦ Synopsis

This volume contains the proceedings of the Fifth International Conference on Coordination Models and Languages (Coordination 2002), held in York, UK, 8–11 April 2002. Coordination models and languages close the conceptual gap - tween the cooperation model used by the constituent parts of an application and the lower-level communication model used in its implementation. Coordinati- based methods provide a clean separation between individual software com- nents and their interactions within their overall software organization. This se- ration, together with the higher-level abstractions o?ered by coordination models and languages, improve software productivity, enhance maintainability, advocate modularity, promote reusability, and lead to software organizations and arc- tectures that are more tractable and more amenable to veri?cation and global analysis. Coordination is relevant in design, development, debugging, maintenance, and reuse of all complex concurrent and distributed systems. Speci?cally, - ordination becomes paramount in the context of open systems, systems with mobile entities, and dynamically re-con?gurable evolving systems. Moreover, - ordination models and languages focus on such key issues in Component Based Software Engineering as speci?cation, interaction, and dynamic composition of components.

✦ Table of Contents

Lecture Notes in Computer Science
Springer
Coordination Models and Languages
Preface
Steering Committee
Program Committee
Organizing Chair
Referees
Table of Contents
Invited Presentations
Accepted Papers
Playing Games with Software Design
Coordination and System Design in a Network-Centric Age
Time, Knowledge, and Cooperation: Alternating-Time Temporal Epistemic Logic and Its Applications
Coordination for Orchestration
On the Challenges Raised by Web Services Architectures
Why Object-Oriented Techniques Cannot Address Them
How "Coordination'' Can Contribute to "Service Orchestration''
Concluding Remarks
References
Concurrent Semantics for the Web Services Specification Language DAML-S
1 Introduction
2 The DAML-S Ontology
3 Modelling DAML-S Core
4 Semantics of DAML-S
5 Conclusions
References
Coordination through Channel Composition
Introduction
Basic Concepts
Primitive Operations on Channels
Connectors
Channel Types
Dataflow through Nodes
Expressiveness
Conclusion
References
Exogenous and Endogenous Extensions of Architectural Types
Introduction
PADL: A Process Algebra Based ADL
Exogenous Extensions
Endogenous Extensions
Conclusion
References
Coordinating Mobile Object-Oriented Code
Introduction
Mobility and Object-Oriented Code
MoMI: Mobile Mix in Calculus
Object-Oriented Expressions
MoMI Syntax
Mixin Mobility in Action
Operational Semantics
Typing
Type Rules
Subtyping Relation
A Scenario for Mixin Mobility
Conclusions and Related Work
Acknowledgments
References
Formalizing Properties of Mobile Agent Systems
Introduction
The Language KLAIM
The System for Software Update
A Prototype Implementation of the Software Update System
The Update Agents
The Logic for KLAIM
System's Properties
Server's Replies
Clients' Registration
Deadlock Freedom
Conclusions
References
Dynamically Adapting the Behaviour of Software Components
Introduction
Interface Description
Connection Specification
Adaptors
Concluding Remarks
References
An Associative Broadcast Based Coordination Model for Distributed Processes
1 Introduction
1.1 Associative Broadcast – Overview
1.2 Coordination and Composition under Associative Broadcast
1.3 Composition as Coordination and Vice Versa
2 Coordination/Composition in Associative Broadcast
2.1 Naming Models and Communication Models
2.2 A Coordination-Oriented Implementation of Associative Interactions
2.3 Requirements for Implementation of Associative Broadcast Based Coordination
2.4 Implementation and Applications
2.5 Properties of Associative Broadcast Coordination
3 Distributed Mutual Exclusion in Associative Broadcast
3.1 Basic Algorithm
3.2 Task Entry Algorithm
3.3 Task Exit Algorithm
3.4 Task Failure
3.5 Experimental Results
4 Related Work – Relationship of Associative Communication and Coordination to Other Models of Communication and Coordination
5 Summary and Future Research
References
Appendix A: Informal Proof of Correctness of Distributed Associative Mutual Exclusion
Definitions
Assumptions
Theorem
State- and Event-Based Reactive Programming in Shared Dataspaces
Introduction
Reactive Programming in Shared Dataspaces
The Calculus
Comparing the Reactive Mechanisms
Encoding L[notify] in L[monitor]
Encoding L[forEach] in L[monitor]
Encoding of L[monitor] in L[forEach,notify]
Encoding L[notify] in L[forEach]
Encoding L[forEach] in L[notify]
Conclusion
References
Integrating Two Organizational Systems through Communication Genres
1 Introduction
2 Overview
3 Conceptual Approach
4 Using the Approach
The Organizational Context
The Genre Elicitation Process
5 Evaluation
6 Conclusion
Acknowledgments
References
OpenCoLaS a Coordination Framework for CoLaS Dialects
1. Introduction
2. The CoLaS Coordination Model and Language
2.1 The Participants
2.2 Coordination Groups
Coordination Specification
3. An Example - The Electronic Vote
Coordination Specification
Pseudo-Variables
4. The OpenCoLaS Framework
4.1 Reactive Coordination Rules
4.2 Proactive Coordination Rules
5. Conclusions and Related Work
References
Coordination in a Reflective Architecture Description Language
Introduction
Reflection in Architecture
Structural Language
Reification
Dynamic Language
Brief Note about Semantics
PiLar as a Coordination Language
Conclusions and Future Work
References
Coordinating Software Evolution via Two-Tier Programming
Abstraction
Abstraction Quod Zooming-Out
Abstraction Quod Parameterization
Case Study: The Observer Pattern
Programming for Evolution
Two-Tier Programming
Functional Requirements
Acknowledgements
References
Criteria for the Analysis of Coordination in Multi-agent Applications
1 Introduction
2 Coordination Mechanisms
3 Coordination Approaches in Some Applications
4 Analysis and Comparison Criteria Used for Coordination
4.1 Analysis Criteria Proposed
4.2 Comparison among Coordination Approaches
4.3 Relationship among Coordination Mechanisms and Approaches
5 Conclusion
References
Towards a Colimit-Based Semantics for Visual Programming
Introduction
Components and Visual Programming
Visual Assembly of Components
A 'Counter' Example
But What Does It Mean?
Connectors and Superposition
Categorical Semantics of Superposition
Superposition via Colimits
A Simplified Example of the Categorical Semantics
Traced Processes
Assembling Components
Conclusion
References
The Cost of Communication Protocols and Coordination Languages in Embedded Systems
Introduction
Services Offered by Interaction Languages
Classification of Services
Configuration or Coordination Services
Steady-State or Communication Services
Inspection Services
General Properties
Global versus Local
Static versus Dynamic
Three Running Examples
Services and the Cost of Designing
Implementation of Interaction Language Services
A Classification of Interaction Language Implementations
Centralised versus Distributed
Hardware versus Software
Emulated versus Native
Interaction Language Implementations: A Compromise of Services and Architecture
Examples Continued
Implementations and the Manufacturing Cost
Closing Remarks
References
Operational Semantics for Coordination in Paradigm
Introduction
Paradigm
Operational Semantics and Basic Examples
A More Complicated Example
Concluding Remarks
References
Service Provision in Ad Hoc Networks
1. Introduction
2. Service Model
3. Mobility
4. Service Model Revisited
5. Coordination-Based Design Solution
5.1 LIME Overview
5.2 Service Representation
5.3 Service Access
5.4 Service Continuity upon Migration
5.5 Discussion
6. Conclusions
References
PN^2: An Elementary Model for Design and Analysis of Multi-agent Systems
Introduction
Concept of Multi-agent Systems
PN^2
Example of Modeling
Preliminaries
Definition of PN^2s
State Transition Rule
Properties of Multi-agent Systems Modeled by PN^2s
Relationship between P/T Nets and PN^2s
Mathematical Analysis of PN^2s
State Equation
Invariants
Related Work
Conclusion
References
A Recovery Technique Using Multi-agentin Distributed Computing Systems^1
1 Introduction
2 Multi-agent Based Fault-Tolerance System Architecture
2.1 System Model
2.2 System Components
3 Agent Communication Language
3.1 Ontology for Rollback-Recovery
3.2 KIF for Domain Knowledge
3.3 KQML for Agent Communication
4 Rollback-Recovery Algorithms Using Agents
4.1 Basic Algorithm During Failure-Free Operation
4.2 Rollback-Recovery Algorithm after a Failure
4.3 Example
5 Simulation
6 Conclusion
References
An Order-Based, Distributed Algorithm for Implementing Multiparty Interactions
Introduction
The Multiparty Interaction Model in a Nutshell
Our Proposal: α–core
Related Work
Conclusions and Future Work
References
Exploiting Transiently Shared Tuple Spaces for Location Transparent Code Mobility
Introduction
Motivation
LIME: Linda in a Mobile Environment
Transiently Shared Tuple Spaces as Code Bases
Enhancing a Mobile Code Toolkit with Location Transparent Class Loading
µCode
Providing Transiently Shared Class Spaces in µCode
Hiding LIME
Other Considerations
Discussion and Related Work
Conclusions and Future Work
Acknowledgments
References
Formal Specification of JavaSpaces^TM Architecture Using μCRL
Introduction
JavaSpaces
Introduction to µCRL
Formal Specification
Application Point of View
Implementation Point of View
Verification
Simple Ping-Pong
More Complex Ping-Pong
Related Work
Conclusion
References
Objective vs. Subjective Coordination in Agent-Based Systems: A Case Study
The Case Study
Design and Development: Objective vs. Subjective Coordination
The Subjective Approach
The JavaSpaces Approach
The TuCSoN Approach
Discussion
References
Scheduling under Uncertainty: Planning for the Ubiquitous Grid
1 Introduction
2 Autonomous Service Providers
3 CHAIMS
3.1 CLAM
3.2 CPAM
4 Scheduling in an Uncertain Environment
4.1 Simple Planning
4.2 Monitoring and Repairing Schedules
4.3 Initial Results
5 Related Work
5.1 Mariposa
5.2 NOW (Networks of Workstations)
5.3 Grid Computing
5.4 ePert and Extensions
6 Future Work
7 Conclusions
References
Using Logical Operators as an Extended Coordination Mechanism in Linda
Introduction
Background
LogOp Linda
The OR Operator
The AND Operator
The NOT Operator
Implementation
Using Wrapper Functions
Preliminary Results
Related Work
Conclusion and Future Work
References
A Framework for Coordinating Parallel Branch and Bound Algorithms
Introduction
Branch and Bound Algorithms
Overview
Parallelization
Manifold
The Coordination Framework
Components
Coordination
Experiments with the Framework
Comparison with Existing Frameworks
Conclusions and Further Research
Acknowledgements
References
Policies for Cooperative Virtual Teams
Introduction
Related Work
Interaction Model
Access Contracts
Synchronization Contracts
Examples
Consistency and Composition of Cooperation Policies
Motu : A Framework for Virtual Teams
Conclusion and Future Work
References
The SPACETUB Models and Framework
Analysis and Classification
Primitives
Tuple Space Models
Time
Security
Activity
The SPACETUB Framework
Design
Usage
Conclusions
References
Tuple-Based Models in the Observation Framework
Introduction
Classes of Formal Frameworks for Coordination
The Observation Approach
Formal Framework
Notation
The Operational Semantics of an Observable Source
Modelling a Coordination Medium
Modelling Linda Tuple Spaces
Modelling JavaSpaces
Modelling Tuple Centres
Related Works and Conclusions
References
Extending the Matching Facilities of Linda
Introduction
Problems with the Associative Matching Mechanism
Extended Linda Systems
TSpaces
XMLSpaces
The Work of the York Coordination Group
Liam
Objective Linda
CO^3PS
ELLIS
Summary
eLinda
The Programmable Matching Engine
Limitations and Applications of the Programmable Matching Engine
Conclusions
Future Work
Acknowledgments
References
Semantics of Protocol Modules Composition and Interaction
Introduction
Architecture
Cactus
Microprotocols and Events
Event Raising and Handling
Messages
Message Events
Appia
Layers and Sessions
QoS Definitions and Channels
Routing Table
Events and Messages
Event Scheduling and Routing
Example Protocol Decomposition
Brief Comparison
Related Work
Conclusion
Contribution
Further Research
Acknowledgements
References
Author Index