Communicating sequential processes
Communicating sequential processes
A calculus of mobile processes, I
Information and Computation
ACM Computing Surveys (CSUR)
Communication and Concurrency
| Hi-index | 0.00 |
The operators of the mobile telephony are more and more demanding towards their applications. They wait for a big reliability, for a number ceaselessly increasing of services, the respect for the constraints of conviviality, for cost, etc. Therefore, the size and the complexity of the applications increase. The current techniques do not allow protecting us from problems of conception. That is why we need a high-level modelling, which will allow us to analyze the organization between the various elements of the system and the interactions between these elements. The interest of the systems multi agents ensues from collective behaviour produced by the interactions of several autonomous and flexible entities called agents, whom these interactions turn around the cooperation, around the competition or of her(it). However techniques come from this domain, concentrate more on the expression of the relations inter-agents. The expression of the mobility from the point of view of the distributed systems is not described. A property acquired time, will allow processes to choose themselves to move on the site s of a network to work locally on the resources and be exchanged their interactions. Reason for which, we are going to propose in this paper a formalization which appeals to an algebra of process, which is π -calcul, to conceive systems automobile adaptive which can react to the shape of the problem.