Authors:
Nadeem Akhtar
;
Yann Le Guyadec
and
Flavio Oquendo
Affiliation:
VALORIA Computer Science Laboratory, France
Keyword(s):
Multi-Agent Systems, Agent Models and Architecture, Gaia multi-agent methodology, Formal methods, Formal verification, Finite State Process (FSP), Labelled Transition System (LTS), Labelled Transition System Analyzer (LTSA), Safety property, Liveness property, Deadlock.
Related
Ontology
Subjects/Areas/Topics:
Agent Models and Architectures
;
Agents
;
Artificial Intelligence
;
Artificial Intelligence and Decision Support Systems
;
Distributed and Mobile Software Systems
;
Enterprise Information Systems
;
Knowledge Engineering and Ontology Development
;
Knowledge-Based Systems
;
Multi-Agent Systems
;
Software Engineering
;
Symbolic Systems
Abstract:
One of the most challenging task in software specifications engineering for robotics multi-agent systems is to ensure correctness. As these systems have high concurrency, often have dynamic and distributed environments, the formal specification and verification of these systems along with step-wise refinement from abstract to concrete concepts play major role in system correctness. Our objectives are the formal specification, analysis with respect to functional as well as non-functional properties by step-wise refinement from abstract to concrete specifications and then formal verification of these specifications. Multi-agent robotics systems are concurrent systems with processes working in parallel with synchronization between them. We have worked on Gaia multi-agent method along with finite state process based finite automata techniques and as a result we have defined the formal specifications of our system, checked the correctness and verified all possible flow of concurrent execu
tions of these specifications. Our contribution consists in transforming Gaia organizational abstractions into executable FSP specifications that can be verified using LTS. We have considered a case study of our multi-agent robotics system to exemplify formal specifications and verification.
(More)