Applying Type Theory to Formal Specification of Recursive Multiagent Systems

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.