From Agent Game Protocols to Implementable Roles

kostas.stathis-at-cs.rhul.ac.uk Abstract. We present a formal framework for decomposing agent interaction protocols to the roles their participants should play. The framework allows an Authority Agent that knows a protocol to compute the protocol’s roles so that it can allocate them to interested parties. We show how the Authority Agent can use the role descriptions to identify problems with the protocol and repair it on the fly, to ensure that participants will be able to implement their role requirements without compromising the protocol’s interactions. Our representation of agent interaction protocols is a game-based one and the decomposition of a game protocol into its constituent roles is based upon the branching bisimulation equivalence reduction of the game. The work extends our previous work on using games to admit agents in an artificial society by checking their competence according to the society rules. The applicability of the overall approach is illustrated by showing how to decompose the NetBill protocol into its roles. We also show how to automatically repair the interactions of a protocol that cannot be implemented in its original form.

Better abstractions for reusable components & architectures

Software architecture (SA) is a crucial component of Model Driven Engineering (MDE), since it eases the communication and reuse of designs and components. However, existing languages (e.g., UML, AADL, SysML) are lacking many needed features. In particular, they provide rudimentary support for connectors, a first-class element in the components and connectors (C&C) architectural view and one of the most reusable architectural elements. This is unfortunate, since the difficult properties that need to be guaranteed for complex systems are mainly the non-functional properties, like throughput, security and dependability, which are greatly influenced by the employed connectors. This work reviews the basic abstractions of the C&C view of SA and examines extra architectural elements which can support the detailed, explicit and separate description of behaviour, interaction and control logic

Methodological design and comparative evaluation of a MAS providing AmI

Researches on Ambient Intelligent and Ubiquitous Computing using wireless technologies have increased in the last years. In this work, we review several scenarios to define a multi-agent architecture that support the information needs of these new technologies, for heterogeneous domain. Our contribution consists of designing in a methodological way a Context Aware System (involving location services) using agents that can be used in very different domains. We describe all the steps followed in the design of the agent system. We apply a hybridizing methodology between GAIA and AUML. Additionally we propose a way to compare different agent architectures for Context Aware System using agent interactions. So, in this paper, we describe the assignment of weight values to agents interaction in two different MAS architectures for Context Aware problems solving different scenarios inspired in FIPA standard negotiation protocols.Publicad

Positionnement des systèmes multi-agents pour les systèmes de transport intelligents

National audienceThe use of new information and communication technologies has become a central solution to improve transport systems. What has led to which is called the Intelligent Transport Systems (ITS). Societal challenges for ensuring their effective implementations are crucial both to respond to users needs, and to design sustainable transport systems. In this paper, we argue that multi-agent paradigm can address the needs of this domain. We introduce ITS, and we emphasize three main issues of ITS which are how to ensure its functionality, how to render it more "intelligent" despite constraints in scalability, and the ethical implications. Some selected research works are provided to illustrate these issuesL’utilisation des nouvelles technologies de l’information et de la communication pour l’amélioration des systèmes de transport est une solution devenue centrale dans le domaine du transport. Le résultat est ce que l’on appelle les systèmes de transport intelligents (STI). Les enjeux sociétaux de leur mise en œuvre sont cruciaux en termes de réponse aux besoins des usagers mais également pour la conception de systèmes de transports durables. Dans ce papier, nous défendons l’idée que le paradigme multi-agent peut répondre aux besoins de ce domaine. Nous proposons ainsi de présenter le domaine des STI et de focaliser notre attention sur trois problématiques : la manière d’assurer sa fonctionnalité, la manière de le rendre plus « intelligent » malgré des contraintes de passage à l’échelle, et enfin ses conséquences éthiques. Quelques travaux de recherche illustrent notre propos

Logic and Topology for Knowledge, Knowability, and Belief - Extended Abstract

In recent work, Stalnaker proposes a logical framework in which belief is realized as a weakened form of knowledge. Building on Stalnaker's core insights, and using frameworks developed by Bjorndahl and Baltag et al., we employ topological tools to refine and, we argue, improve on this analysis. The structure of topological subset spaces allows for a natural distinction between what is known and (roughly speaking) what is knowable; we argue that the foundational axioms of Stalnaker's system rely intuitively on both of these notions. More precisely, we argue that the plausibility of the principles Stalnaker proposes relating knowledge and belief relies on a subtle equivocation between an "evidence-in-hand" conception of knowledge and a weaker "evidence-out-there" notion of what could come to be known. Our analysis leads to a trimodal logic of knowledge, knowability, and belief interpreted in topological subset spaces in which belief is definable in terms of knowledge and knowability. We provide a sound and complete axiomatization for this logic as well as its uni-modal belief fragment. We then consider weaker logics that preserve suitable translations of Stalnaker's postulates, yet do not allow for any reduction of belief. We propose novel topological semantics for these irreducible notions of belief, generalizing our previous semantics, and provide sound and complete axiomatizations for the corresponding logics.Comment: In Proceedings TARK 2017, arXiv:1707.08250. The full version of this paper, including the longer proofs, is at arXiv:1612.0205

Non-Zero Sum Games for Reactive Synthesis

In this invited contribution, we summarize new solution concepts useful for the synthesis of reactive systems that we have introduced in several recent publications. These solution concepts are developed in the context of non-zero sum games played on graphs. They are part of the contributions obtained in the inVEST project funded by the European Research Council.Comment: LATA'16 invited pape