The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Mobile agents have been advocated to support electronic commerce over the Internet. While being a promising paradigm, many intricate problems such as security and fault tolerance need to be solved to make this vision reality. In this paper we have proposed a fault tolerant comparison internet shopping system BestDeal. We assume that both the mobile agent and the host responsible to execute mobile...
Software engineering (SE) courses aim to make students well-versed in solving authentic and complex problems by applying varied SE knowledge skills along with problem solving, critical thinking, use of tools, communication skills etc. Thus they have multiple, complex and some higher order cognitive learning goals. Traditional assessment tools like multiple choice questions, subjective questions, etc...
Locating mobile agents in a network of mobile agent systems still represents an open research issue. The cost of location management strategies mainly depends on the cost of search and update. We have developed a location management technique, named broadcasting with search by path chase (BSPC), applicable for multi-region environments. Using a Petri net tool we modeled, analyzed and simulated BSPC...
A mobile agent (MA) is an autonomous and identifiable software process that travels through a network of heterogeneous machines and acts autonomously on behalf of the user. Improving the survivability of MA in presence of various faults is the major issue concerned with implementation of MA. This paper presents a hierarchical fault tolerance protocol (HFTP) for mobile agents, which can tolerate host...
The class of Discrete Event Systems which can be modelled as timed event graphs may be described by linear equations in a non-traditional algebraic systems called a dioid or max-algebra. This paper extends the dioid algebra approach to a broader class of systems including both timed and untimed models, time-varying systems, and decision-making systems. We introduce an algebraic structure called a...
In this paper, we study problems of designing a dispatching unit in the logical framework of discrete event dynamical systems. An "input" language (respectively, an "output" language) is used to describe the collection of all finite length sequences in which various parts may arrive at (respectively, depart from) a dispatching unit. A notion of input-output boundedness or stability...
In this paper we study suitability of using assignment based programming language for supervisory control of discrete event systems. We first show that the supervisory control problem in its general setting is undecidable. Next we show that the supervisory control problem for discrete event systems modeled by assignment based programs is decidable and develop techniques which reduce the supervisory...
We model the problem of Distributed Resource Management using supervisory predicate control, and develop a supervisor to manage the resources according to a desirable predicate. The desirable predicate states that resource requests (uncontrollable event) must be serviced according to some cost constraint. Traditional methods for developing the supervisor fail because an unconstrained sequence of uncontrollable...
Ramadge and Wonham have established a control theory of DES modeled by state machines. Previous work by Ramadge extended the concept of controllable languages to infinite languages and presented conditions for the existence of a supervisor for systems modeled by Buchi automata. This paper derives requirements for the existence of a supervisor under less restrictive conditions on the constraint language...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.