By Topic

Applying Type Theory to Formal Specification of Recursive Multiagent Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hoang Thi Thanh Ha ; LCIS Lab., Univ. de Grenoble, Valence, France ; Occello, M. ; Nguyen Thanh Binh

Nowadays software systems are more and more complex. Such systems are composed of many sub-systems, in which each sub-system exists and interacts with other subsystems. Since a few years, multiagent systems (MAS) propose well considered approaches for these kinds of systems. In this paper, we concentrate on recursive MAS which are well adapted to describe complex systems. Up to now, recursive MAS are only specified by informal languages. This paper proposes the use of type theory to specify recursive MAS. This work constitutes a first theoretical step in the elaboration of a generic software tool for reliable design of recursive MAS.

Published in:

Computing and Communication Technologies, 2009. RIVF '09. International Conference on

Date of Conference:

13-17 July 2009