Using SPIN for verification of multiagent data analysis

The paper presents an approach to formal verification of multiagent data analysis algorithms for ontology population. The system agents correspond to information items of the input data and the rule of ontology population and data processing. They determine values of information objects obtained at...

Full description

Saved in:
Bibliographic Details
Published in:Automatic control and computer sciences 2015-12, Vol.49 (7), p.420-429
Main Authors: Garanina, N. O., Bodin, E. V., Sidorova, E. A.
Format: Article
Language:English
Subjects:
Computer Science
Control Structures and Microprogramming
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The paper presents an approach to formal verification of multiagent data analysis algorithms for ontology population. The system agents correspond to information items of the input data and the rule of ontology population and data processing. They determine values of information objects obtained at the preliminary phase of the analysis. The agents working in parallel check the syntactic and semantic consistency of tuples of information items. Since the agents operate in parallel, it is necessary to verify some important properties of the system related to it, such as the property that the controller agent correctly determines the system termination. In our approach, the SPIN model checking tool is used. The agent protocols are written in the Promela language (the input language of the tool), and the properties of the multiagent data analysis system are expressed in liner time logic (LTL). We carried out several experiments to check this model in various modes of the tool and for various numbers of agents.
ISSN:0146-4116
1558-108X
DOI:10.3103/S014641161507007X