The-calculus is a process algebra which originates from CCS and permits a natural modelling of mobility (i.e., dynamic reconngurations of the process linkage) using communication of names. Previous research has shown that the-calculus has much greater expres-siveness than CCS, but also a much more complex mathematical theory. The primary goal of this work is to understand the reasons of this ga...

This paper provides a logical framework of negotiating agents who have capabilities of evaluating and building proposals. Given a proposal, an agent decides whether it is acceptable or not. If the proposal is unacceptable as it is, the agent seeks conditions to accept it. This attitude is captured as a process of making hypotheses by induction. If an agent fails to find a hypothesis, it would c...

The efficiency of Distributed Constraints satisfaction algorithms must be measured by concurrent performance measures. In Previous studies we have proposed the count of non concurrent logical steps as an asynchronous measure. This measure is independent of the specific implementation and is not affected by the level of concurrency of the performing algorithm. The method of counting non-concurre...

During the recent years of research on mobile agents, significant effort has been directed towards the identification of models of agent mobility suitable for network management applications. Also, a lot of research work is currently being carried out trying to provide an assessment of mobile agent frameworks used to build agent-based network management systems. In this paper we clarify three d...

The-calculus is a process algebra which originates from CCS and permits a natural modelling of mobility (i.e., dynamic reconngurations of the process linkage) using communication of names. Previous research has shown that the-calculus has much greater expressiveness than CCS, but also a much more complex mathematical theory. The primary goal of this work is to understand the reasons of this gap...

Logical mobility ranges from simple data mobility, where information is transferred, through code mobility that allows the migration of executable code, to mobile agents, in which code and data move together. Several application domains need a more exible approach to code mobility than the one that can be achieved with Java and with mobile agents in general. This exibility can either be require...

The emerging mobile computing environment draws new attention to the need for coordination among networked components. The very nature of this environment requires parties to interact even when they have never met before, and subsequent encounters are totally unpredictable. Because mobile networks are often decoupled from any fixed network infrastructure, reliance on centralized servers to auth...

The increased pervasiveness of wireless mobile computing devices draws new attention to the need for coordination among small, networked components. The very nature of the environment requires devices to interact even when they meet unpredictably. Because these networks are often decoupled from a fixed infrastructure, reliance on centralized servers for authentication and access policies is imp...

Agent network topology is one of the fundamental issues in the multi-agent area. Different from existing network topological theory, such as LAN or distributed system networks, agent network topology emphasizes communications and transactions between agents. Mobility and intelligence issues are major concerns in agent network topologies and these have not received much attention. In this paper,...

LimeLite is a new coordination model and middleware designed to support rapid development of applications entailing logical mobility of agents and physical mobility of hosts. Designed to function in open environments, LimeLite performs automatic agent discovery but filters the results to define for each agent an individualized acquaintance list in accordance with run-time policies specified at ...