Compositional Design and Verification of a Multi-Agent System for One-to-Many Negotiation

A compositional verification method for multi-agent systems is presented and applied to a multi-agent system for one-to-many negotiation in the domain of load balancing of electricity use. Advantages of the method are that the complexity of the verification process is managed by compositionality, and that parts of the proofs can be reused in relation to reuse of components

Principles of Compositional Multi-agent System Development

A dedicated development method for multi-agent systems requires adequate means to describe the characteristics of agents and multi-agent systems. Compositional multi-agent system development is based on the principles process and knowledge abstraction, compositionality, reuse, specification and verification. Although the paper addreses these principles of compositional multi-agent system development from a generic perspective, some of the examples used to illustrate the notions discussed are taken from the compositional development method DESIRE

Contract Aware Components, 10 years after

The notion of contract aware components has been published roughly ten years ago and is now becoming mainstream in several fields where the usage of software components is seen as critical. The goal of this paper is to survey domains such as Embedded Systems or Service Oriented Architecture where the notion of contract aware components has been influential. For each of these domains we briefly describe what has been done with this idea and we discuss the remaining challenges.Comment: In Proceedings WCSI 2010, arXiv:1010.233

Principles of Component-Based Design of Intelligent Agents

Compositional multi-agent system design is a methodological perspective on multiagent system design based on the software engineering principles process and knowledge abstraction, compositionality, reuse, specification and verification. This pape

Software Agents for Electronic Marketplaces: Current and Future Research Directions

The premise of software agents to define the structural and operational models of the virtual marketplace of the future can account for the increased interest regarding their application in areas where they can add substantial value in terms of automation and functionality. At the heart of such a marketplace rests an ontology modeling the domain upon which a nucleus of agent-based services can be constructed. Negotiation services hold the dominant position in terms of the attention they have received in research. Complementary to them, but no less important, are the advising services representing support functionality that is required throughout the cycle of a deal; from the expressed intention of the two parties to eventual maturity and closure. In this paper we focus on research trends and on their possible future development for ontologies and the above service categories emphasizing on the role of software agents in this context. A review and analysis of past and present works helps to formulate sets of questions that future research will seek to address

Designing Self-Modifying Agents

Agents need to be able to adapt to changes in their environment. One way to achieve this, is to provide agents with the ability of self-modification. Self-modification requires reflection and strategies with which new knowledge can be acquired, a necessary condition for creativity. This paper describes a knowledge-level model for the design of self-modifying agents and explores the feasibility of automatically designing self-modifying agents

Petri net-based approach for web service automation resource coordination

In industrial automation, control systems and mechatronic devices are from diverse nature, supplied by different manufacturers and made of different technologies. The adoption of web services principles in an automated production system satisfies some requirements, namely the interoperability of such heterogeneous and distributed environments and the basis for flexibility and reconfigurability. Manufacturing processes require to access resources at different precedence levels and time instances, but in the other way resources may also be shared by different processes. A major challenge is then how individual services may interact, coordinating their activities. Petri nets may be used to describe complex system behaviour and therefore also applied to coordinate such systems. The paper introduces a Petri net based approach for the design, analysis and coordination of systems developed using web services to represent individual and autonomous resources. For this purpose, it is presented a Petri nets computational tool to support the design, validation and coordination of web service based automation systems.info:eu-repo/semantics/publishedVersio

On Global Types and Multi-Party Session

Global types are formal specifications that describe communication protocols in terms of their global interactions. We present a new, streamlined language of global types equipped with a trace-based semantics and whose features and restrictions are semantically justified. The multi-party sessions obtained projecting our global types enjoy a liveness property in addition to the traditional progress and are shown to be sound and complete with respect to the set of traces of the originating global type. Our notion of completeness is less demanding than the classical ones, allowing a multi-party session to leave out redundant traces from an underspecified global type. In addition to the technical content, we discuss some limitations of our language of global types and provide an extensive comparison with related specification languages adopted in different communities

Agreement Computing

[EN] In this paper we introduce the concept of Agreement Computing, motivate the central role that the concept of agreement plays in open software systems and discuss a number of research challenges that need to be addressed to make the agreement computing vision a reality.Research supported by the Agreement Technologies CONSOLIDER project under contract CSD2007-0022 and INGENIO 2010 and by the Agreement Technologies COST Action, IC0801.Sierra Garcia, C.; Botti Navarro, VJ.; Ossowski, DS. (2011). Agreement Computing. KI - Künstliche Intelligenz. 25(1):57-61. https://doi.org/10.1007/s13218-010-0070-yS5761251Arcos JL, Esteva M, Noriega P, Rodríguez JA, Sierra C (2005) Engineering open environments with electronic institutions. Eng Appl Artif Intell 18(2):191–204Boella G, Noriega P, Pigozzi G, Verhagen H (2009) In: Dagstuhl seminar proceedings 09121: normative multi-agent systems.Henrik G, Wright V (1963) Norm and action, a logical enquiry. Routledge and Kegan Paul, LondonHermenegildo M, Albert E, López-García P, Puebla G (2005) Abstraction carrying code and resource-awareness. In: Principle and practice of declarative programming. ACM Press, New YorkJennings N, Faratin P, Lomuscio A, Parsons S, Sierra C, Wooldridge M (2001) Automated negotiation: prospects methods and challenges. Group Decis Negot 10(2):199–215Jøsang A, Ismail R, Boyd C (2007) A survey of trust and reputation systems for online service provision. Decis Support Syst 43(2):618–644Kalfoglou Y, Schorlemmer M (2003) IF-Map: an ontology-mapping method based on information-flow theory. In: Spaccapietra S, March S, Aberer K (eds) Journal on data semantics I. Lecture notes in computer science, vol 2800. Springer, Heidelberg, pp 98–127Ko RKL, Lee SSG, Lee EW (2009) Business process management (bpm) standards: a survey. Bus Process Manag J 15(5):744–791Kraus S (1997) Negotiation and cooperation in multi-agent environments. Artif Intell 94(1–2):79–97March J (1996) A preface to understanding how decisions happen in organizations. In: Organizational decision-making, Cambridge University Press, CambridgeNecula GC, Lee P (1996) Proof-carrying code. Tech repRoss A (1968) Directives and norms. Humanities, Atlantic HighlandsSierra C, Debenham J (2006) Trust and honour in information-based agency. In: Proceedings of the 5th international conference on autonomous agents and multiagent systems. ACM Press, New York, pp 1225–1232Simon HA Administrative behavior. Free Press (1997)Vasirani M, Ossowski S (2009) A market-inspired approach to reservation-based urban road traffic management. In: Proceedings of the 8th international conference on autonomous agents and multiagent systems, IFAAMAS, pp. 617–62

Distributed execution of bigraphical reactive systems

The bigraph embedding problem is crucial for many results and tools about bigraphs and bigraphical reactive systems (BRS). Current algorithms for computing bigraphical embeddings are centralized, i.e. designed to run locally with a complete view of the guest and host bigraphs. In order to deal with large bigraphs, and to parallelize reactions, we present a decentralized algorithm, which distributes both state and computation over several concurrent processes. This allows for distributed, parallel simulations where non-interfering reactions can be carried out concurrently; nevertheless, even in the worst case the complexity of this distributed algorithm is no worse than that of a centralized algorithm