in this paper, a formal model for antivirus update agent system is presented based on mobile agent technology and predicate/transition petri nets. the mobile agent system contains two mobile agents called dca and una. it sends out agents to update antivirus on client computers in a network. each agent takes on a specified responsibility. first, dca roams through the network and check the last d...

In this paper, a formal model for antivirus update agent system is presented based on mobile agent technology and predicate/transition Petri nets. The mobile agent system contains two mobile agents called DCA and UNA. It sends out agents to update antivirus on client computers in a network. Each agent takes on a specified responsibility. First, DCA roams through the network and check the last d...

In this paper, a formal model for antivirus update agent system is presented based on mobile agent technology and predicate/transition Petri nets. The mobile agent system contains two mobile agents called DCA and UNA. It sends out agents to update antivirus on client computers in a network. Each agent takes on a specified responsibility. First, DCA roams through the network and check the last d...

This paper presents an approach for modeling and modelchecking a mobile agent system specified by LAM, which is a two-layer formal method for characterizing logical agent mobility using Predicate/Transition (PrT) nets. Based on the transformation of PrT nets into input programs of the model checker SPIN, we model check a variety of properties with respect to agents, logical agent mobility, agen...

The process of agent migration is the major difference between logical code mobility of software agents and physical mobility of mobile nodes in ad hoc networks. Without considering agent transfer, it would make little sense to mention the modeling of strong code mobility, which aims to make a migrated agent restarted exactly from the state when it was stopped before migration. From the perspec...

In this paper, we consider the mobility management in large, hierarchically organized multihop wireless networks. The examples of such networks range from battlefield networks, emergency disaster relief and law enforcement etc. We present a novel network addressing architecture to accommodate mobility using a “Home Agent” concept akin to mobile IP. We distinguish between the “physical” routing ...

In this paper we present a hierarchical routing protocol in a large wireless, mobile network such as found in the automated battle field or in extensive disaster recovery operations. Conventional routing does not scale well to network size. Likewise, conventional hierarchical routing cannot handle mobility eficiently. We propose a novel soft state wireless hierarchical routing protocol Hierarch...

In this paper we address the problem of routing in a large wireless, mobile network such as found in the automated battle field or in extensive disaster recovery operations. Conventional routing does not scale well to network size. Likewise, conventional hierarchical routing cannot handle mobility efficiently. In this paper, we propose a novel soft state Wireless HIerarchical Routing protocoL (...

We present a type theory characterizing the mobility and locality of program terms in a calculus for distributed computation. The type theory is derived from logical notions of necessity (2A) and possibility (3A) of the modal logic S4 via a Curry-Howard style isomorphism. Logical worlds are interpreted as sites for computation, accessibility corresponds to dependency between processes at those ...