Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Coordinating distributed objects: an actor-based approach to synchronization
Coordinating distributed objects: an actor-based approach to synchronization
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
KLAIM: A Kernel Language for Agents Interaction and Mobility
IEEE Transactions on Software Engineering
Remote Agent: to boldly go where no AI system has gone before
Artificial Intelligence - Special issue: artificial intelligence 40 years later
Proceedings of the 21st international conference on Software engineering
Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers
Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers
Reflection in conditional rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Formal Specification and Design of Mobile Systems
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Semantic Models for Distributed Object Reflection
ECOOP '02 Proceedings of the 16th European Conference on Object-Oriented Programming
An actor-based framework for real-time coordination
An actor-based framework for real-time coordination
A spatial logic for concurrency (part I)
Information and Computation - TACS 2001
Reo: a channel-based coordination model for component composition
Mathematical Structures in Computer Science
Efficient Decentralized Monitoring of Safety in Distributed Systems
Proceedings of the 26th International Conference on Software Engineering
Solving Distributed Constraint Optimization Problems Using Cooperative Mediation
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
Using Cooperative Mediation to Solve Distributed Constraint Satisfaction Problems
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
A spatial logic for concurrency--II
Theoretical Computer Science - Special issue: Foundations of wide area network computing
Formal Checklists for Remote Agent Dependability
Electronic Notes in Theoretical Computer Science (ENTCS)
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
A process calculus for qos-aware applications
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Ten years of analyzing actors: Rebeca experience
Formal modeling
A conceptual framework for adaptation
FASE'12 Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering
Formal modeling of evolving self-adaptive systems
Science of Computer Programming
Modelling and analyzing adaptive self-assembly strategies with maude
WRLA'12 Proceedings of the 9th international conference on Rewriting Logic and Its Applications
Hi-index | 0.00 |
PAGODA (Policy And GOal Based Distributed Autonomy) is a modular architecture for specifying and prototyping autonomous systems. A PAGODA node (agent) interacts with its environment by sensing and affecting, driven by goals to achieve and constrained by policies. A PAGODA system is a collection of PAGODA nodes cooperating to achieve some mutual goal. This paper describes a specification of PAGODA using the Russian Dolls model of policy-based coordination. In PAGODA there are two forms of coordination: local and global. Local coordination is used to compose the components of a PAGODA node. The local coordinator is concerned with ensuring component level synchronization constraints, cross component message ordering constraints, routing of notifications, and interaction with the external world. The global coordinator is concerned with dissemination of information, negotiation of responsibilities, and synchronization of activities. Requirements for a PAGODA node coordinator are given and an example set of policies is specified. Principles for showing that the policies satisfy the requirements are discussed as a first step toward a logic of policy-based coordination. Development of a distributed coordinator is the subject of ongoing work. Some challenges and possible solutions are discussed.